Categories:
Audio (13)
Biotech (29)
Bytecode (36)
Database (77)
Framework (7)
Game (7)
General (507)
Graphics (53)
I/O (35)
IDE (2)
JAR Tools (101)
JavaBeans (21)
JDBC (121)
JDK (426)
JSP (20)
Logging (108)
Mail (58)
Messaging (8)
Network (84)
PDF (97)
Report (7)
Scripting (84)
Security (32)
Server (121)
Servlet (26)
SOAP (24)
Testing (54)
Web (15)
XML (309)
Collections:
Other Resources:
Java Source Code for Xerces Java 2.11.2
Where Can I see Java Source Code files for Xerces Java 2.11.2?
✍: FYIcenter
Here are Java Source Code files for Xerces Java 2.11.2:
⏎ org/apache/xerces/impl/xpath/regex/CaseInsensitiveMap.java
/* * 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.xpath.regex; /** * @xerces.internal * * @version $Id: CaseInsensitiveMap.java 834653 2009-11-10 20:32:39Z mrglavas $ */ final class CaseInsensitiveMap { private static int CHUNK_SHIFT = 10; /* 2^10 = 1k */ private static int CHUNK_SIZE = (1<<CHUNK_SHIFT); private static int CHUNK_MASK = (CHUNK_SIZE-1); private static int INITIAL_CHUNK_COUNT = 64; /* up to 0xFFFF */ private static int[][][] caseInsensitiveMap; private static int LOWER_CASE_MATCH = 1; private static int UPPER_CASE_MATCH = 2; static { buildCaseInsensitiveMap(); } /** * Return a list of code point characters (not including the input value) * that can be substituted in a case insensitive match */ static public int[] get(int codePoint) { return (codePoint < 0x10000) ? getMapping(codePoint) : null; } private static int[] getMapping(int codePoint) { int chunk = codePoint >>> CHUNK_SHIFT; int offset = codePoint & CHUNK_MASK; return caseInsensitiveMap[chunk][offset]; } private static void buildCaseInsensitiveMap() { caseInsensitiveMap = new int[INITIAL_CHUNK_COUNT][CHUNK_SIZE][]; int lc, uc; for (int i=0; i<0x10000; i++) { lc = Character.toLowerCase((char) i); uc = Character.toUpperCase((char) i); // lower/upper case value is not the same as code point if (lc != uc || lc != i) { int[] map = new int[2]; int index = 0; if (lc != i) { map[index++] = lc; map[index++] = LOWER_CASE_MATCH; int[] lcMap = getMapping(lc); if (lcMap != null) { map = updateMap(i, map, lc, lcMap, LOWER_CASE_MATCH); } } if (uc != i) { if (index == map.length) { map = expandMap(map, 2); } map[index++] = uc; map[index++] = UPPER_CASE_MATCH; int[] ucMap = getMapping(uc); if (ucMap != null) { map = updateMap(i, map, uc, ucMap, UPPER_CASE_MATCH); } } set(i, map); } } } private static int[] expandMap(int[] srcMap, int expandBy) { final int oldLen = srcMap.length; int[] newMap = new int[oldLen + expandBy]; System.arraycopy(srcMap, 0, newMap, 0, oldLen); return newMap; } private static void set(int codePoint, int[] map) { int chunk = codePoint >>> CHUNK_SHIFT; int offset = codePoint & CHUNK_MASK; caseInsensitiveMap[chunk][offset] = map; } private static int[] updateMap(int codePoint, int[] codePointMap, int ciCodePoint, int[] ciCodePointMap, int matchType) { for (int i=0; i<ciCodePointMap.length; i+=2) { int c = ciCodePointMap[i]; int[] cMap = getMapping(c); if (cMap != null) { if (contains(cMap, ciCodePoint, matchType)) { if (!contains(cMap, codePoint)) { cMap = expandAndAdd(cMap, codePoint, matchType); set(c, cMap); } if (!contains(codePointMap, c)) { codePointMap = expandAndAdd(codePointMap, c,matchType); } } } } if (!contains(ciCodePointMap, codePoint)) { ciCodePointMap = expandAndAdd(ciCodePointMap, codePoint, matchType); set(ciCodePoint, ciCodePointMap); } return codePointMap; } private static boolean contains(int[] map, int codePoint) { for (int i=0; i<map.length; i += 2) { if (map[i] == codePoint) { return true; } } return false; } private static boolean contains(int[] map, int codePoint, int matchType) { for (int i=0; i<map.length; i += 2) { if (map[i] == codePoint && map[i+1] == matchType) { return true; } } return false; } private static int[] expandAndAdd(int[] srcMap, int codePoint, int matchType) { final int oldLen = srcMap.length; int[] newMap = new int[oldLen + 2]; System.arraycopy(srcMap, 0, newMap, 0, oldLen); newMap[oldLen] = codePoint; newMap[oldLen+1] = matchType; return newMap; } }
⏎ org/apache/xerces/impl/xpath/regex/CaseInsensitiveMap.java
Or download all of them as a single archive file:
File name: Xerces-J.2.12.2-src.zip File size: 2128351 bytes Release date: 2022-01-21 Download
⇒ Donwload Xerces-J-bin.2.11.0.zip
⇐ What Is in Xerces-J-bin.2.12.2.zip
2016-09-15, 45366👍, 1💬
Popular Posts:
What is ojdbc.jar - JDBC Driver for Oracle? ojdbc.jar is a JDBC driver from Oracle that provides dat...
Jackson is "the Java JSON library" or "the best JSON parser for Java". Or simply as "JSON for Java"....
Apache Avalon began in 1999 as the Java Apache Server Framework and in late 2002 separated from the ...
ANTLR is a powerful parser generator for multiple programming languages including Java. ANTLR contai...
JasperReports, the world's most popular open source business intelligence and reporting engine and J...