| Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
| XmlStringFilter |
|
| 9.5;9.5 |
| 1 | /* | |
| 2 | * Copyright (c) 2003-2011, Simon Brown | |
| 3 | * All rights reserved. | |
| 4 | * | |
| 5 | * Redistribution and use in source and binary forms, with or without | |
| 6 | * modification, are permitted provided that the following conditions are met: | |
| 7 | * | |
| 8 | * - Redistributions of source code must retain the above copyright | |
| 9 | * notice, this list of conditions and the following disclaimer. | |
| 10 | * | |
| 11 | * - Redistributions in binary form must reproduce the above copyright | |
| 12 | * notice, this list of conditions and the following disclaimer in | |
| 13 | * the documentation and/or other materials provided with the | |
| 14 | * distribution. | |
| 15 | * | |
| 16 | * - Neither the name of Pebble nor the names of its contributors may | |
| 17 | * be used to endorse or promote products derived from this software | |
| 18 | * without specific prior written permission. | |
| 19 | * | |
| 20 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
| 21 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 22 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 23 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | |
| 24 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
| 25 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
| 26 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
| 27 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
| 28 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
| 29 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
| 30 | * POSSIBILITY OF SUCH DAMAGE. | |
| 31 | */ | |
| 32 | ||
| 33 | package net.sourceforge.pebble.dao.file; | |
| 34 | ||
| 35 | import java.util.BitSet; | |
| 36 | ||
| 37 | /** | |
| 38 | * Filters strings in XML so that they don't contain any illegal characters | |
| 39 | * | |
| 40 | * @author James Roper | |
| 41 | */ | |
| 42 | 0 | public class XmlStringFilter { |
| 43 | ||
| 44 | private static final BitSet LEGAL_CONTROL_CHARACTERS; | |
| 45 | ||
| 46 | static { | |
| 47 | 4 | LEGAL_CONTROL_CHARACTERS = new BitSet(32); |
| 48 | 4 | LEGAL_CONTROL_CHARACTERS.set('\t'); |
| 49 | 4 | LEGAL_CONTROL_CHARACTERS.set('\n'); |
| 50 | 4 | LEGAL_CONTROL_CHARACTERS.set('\r'); |
| 51 | 4 | } |
| 52 | ||
| 53 | private static boolean isLegal(char c) { | |
| 54 | // A character is legal if it's a low or high surrogate, if it's not a | |
| 55 | // control character, or if it's a legal control character | |
| 56 | 15956 | return Character.isLowSurrogate(c) || Character.isHighSurrogate(c) || |
| 57 | c >= 32 || c < 0 || LEGAL_CONTROL_CHARACTERS.get(c); | |
| 58 | } | |
| 59 | ||
| 60 | public static String filter(String s) { | |
| 61 | 1752 | if (s.isEmpty()) { |
| 62 | 292 | return s; |
| 63 | } | |
| 64 | ||
| 65 | 1460 | StringBuilder result = null; |
| 66 | 1460 | int start = 0; |
| 67 | int pos; | |
| 68 | ||
| 69 | 17416 | for (pos = 0; pos < s.length(); pos++) { |
| 70 | 15956 | if (!isLegal(s.charAt(pos))) { |
| 71 | 60 | if (pos > start) { |
| 72 | 28 | if (result == null) { |
| 73 | 20 | result = new StringBuilder(s.substring(start, pos)); |
| 74 | } else { | |
| 75 | 8 | result.append(s.substring(start, pos)); |
| 76 | } | |
| 77 | } | |
| 78 | 60 | start = pos + 1; |
| 79 | } | |
| 80 | } | |
| 81 | ||
| 82 | 1460 | if (start == 0) { |
| 83 | 1428 | return s; |
| 84 | 32 | } else if (pos > start) { |
| 85 | 8 | if (result == null) { |
| 86 | 4 | return s.substring(start, pos); |
| 87 | } else { | |
| 88 | 4 | result.append(s.substring(start, pos)); |
| 89 | } | |
| 90 | } | |
| 91 | 28 | if (result != null) { |
| 92 | 20 | return result.toString(); |
| 93 | } else { | |
| 94 | 8 | return ""; |
| 95 | } | |
| 96 | } | |
| 97 | } |