• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/jaxws_classes/com/sun/xml/internal/fastinfoset/util/CharArray.java@e530533619ec (annotated)

src/share/jaxws_classes/com/sun/xml/internal/fastinfoset/util/CharArray.java

Thu, 12 Oct 2017 19:44:07 +0800

author

aoqi

date

Thu, 12 Oct 2017 19:44:07 +0800

changeset 760

e530533619ec

parent 0

373ffda63c9a

permissions

-rw-r--r--

merge

aoqi@0	1	/*
aoqi@0	2	* Copyright (c) 2004, 2011, Oracle and/or its affiliates. All rights reserved.
aoqi@0	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0	4	*
aoqi@0	5	* This code is free software; you can redistribute it and/or modify it
aoqi@0	6	* under the terms of the GNU General Public License version 2 only, as
aoqi@0	7	* published by the Free Software Foundation. Oracle designates this
aoqi@0	8	* particular file as subject to the "Classpath" exception as provided
aoqi@0	9	* by Oracle in the LICENSE file that accompanied this code.
aoqi@0	10	*
aoqi@0	11	* This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0	12	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0	13	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0	14	* version 2 for more details (a copy is included in the LICENSE file that
aoqi@0	15	* accompanied this code).
aoqi@0	16	*
aoqi@0	17	* You should have received a copy of the GNU General Public License version
aoqi@0	18	* 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0	19	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0	20	*
aoqi@0	21	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0	22	* or visit www.oracle.com if you need additional information or have any
aoqi@0	23	* questions.
aoqi@0	24	*
aoqi@0	25	* THIS FILE WAS MODIFIED BY SUN MICROSYSTEMS, INC.
aoqi@0	26	*/
aoqi@0	27
aoqi@0	28	package com.sun.xml.internal.fastinfoset.util;
aoqi@0	29
aoqi@0	30	public class CharArray implements CharSequence {
aoqi@0	31	public char[] ch;
aoqi@0	32	public int start;
aoqi@0	33	public int length;
aoqi@0	34
aoqi@0	35	protected int _hash;
aoqi@0	36
aoqi@0	37	protected CharArray() {
aoqi@0	38	}
aoqi@0	39
aoqi@0	40	public CharArray(char[] _ch, int _start, int _length, boolean copy) {
aoqi@0	41	set(_ch, _start, _length, copy);
aoqi@0	42	}
aoqi@0	43
aoqi@0	44	public final void set(char[] _ch, int _start, int _length, boolean copy) {
aoqi@0	45	if (copy) {
aoqi@0	46	ch = new char[_length];
aoqi@0	47	start = 0;
aoqi@0	48	length = _length;
aoqi@0	49	System.arraycopy(_ch, _start, ch, 0, _length);
aoqi@0	50	} else {
aoqi@0	51	ch = _ch;
aoqi@0	52	start = _start;
aoqi@0	53	length = _length;
aoqi@0	54	}
aoqi@0	55	_hash = 0;
aoqi@0	56	}
aoqi@0	57
aoqi@0	58	public final void cloneArray() {
aoqi@0	59	char[] _ch = new char[length];
aoqi@0	60	System.arraycopy(ch, start, _ch, 0, length);
aoqi@0	61	ch = _ch;
aoqi@0	62	start = 0;
aoqi@0	63	}
aoqi@0	64
aoqi@0	65	public String toString() {
aoqi@0	66	return new String(ch, start, length);
aoqi@0	67	}
aoqi@0	68
aoqi@0	69	public int hashCode() {
aoqi@0	70	if (_hash == 0) {
aoqi@0	71	// Same hash code algorithm as used for String
aoqi@0	72	// s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]
aoqi@0	73	for (int i = start; i < start + length; i++) {
aoqi@0	74	_hash = 31*_hash + ch[i];
aoqi@0	75	}
aoqi@0	76	}
aoqi@0	77	return _hash;
aoqi@0	78	}
aoqi@0	79
aoqi@0	80	public static final int hashCode(char[] ch, int start, int length) {
aoqi@0	81	// Same hash code algorithm as used for String
aoqi@0	82	// s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]
aoqi@0	83	int hash = 0;
aoqi@0	84	for (int i = start; i < start + length; i++) {
aoqi@0	85	hash = 31*hash + ch[i];
aoqi@0	86	}
aoqi@0	87
aoqi@0	88	return hash;
aoqi@0	89	}
aoqi@0	90
aoqi@0	91	public final boolean equalsCharArray(CharArray cha) {
aoqi@0	92	if (this == cha) {
aoqi@0	93	return true;
aoqi@0	94	}
aoqi@0	95
aoqi@0	96	if (length == cha.length) {
aoqi@0	97	int n = length;
aoqi@0	98	int i = start;
aoqi@0	99	int j = cha.start;
aoqi@0	100	while (n-- != 0) {
aoqi@0	101	if (ch[i++] != cha.ch[j++])
aoqi@0	102	return false;
aoqi@0	103	}
aoqi@0	104	return true;
aoqi@0	105	}
aoqi@0	106
aoqi@0	107	return false;
aoqi@0	108	}
aoqi@0	109
aoqi@0	110	public final boolean equalsCharArray(char[] ch, int start, int length) {
aoqi@0	111	if (this.length == length) {
aoqi@0	112	int n = this.length;
aoqi@0	113	int i = this.start;
aoqi@0	114	int j = start;
aoqi@0	115	while (n-- != 0) {
aoqi@0	116	if (this.ch[i++] != ch[j++])
aoqi@0	117	return false;
aoqi@0	118	}
aoqi@0	119	return true;
aoqi@0	120	}
aoqi@0	121
aoqi@0	122	return false;
aoqi@0	123	}
aoqi@0	124
aoqi@0	125	public boolean equals(Object obj) {
aoqi@0	126	if (this == obj) {
aoqi@0	127	return true;
aoqi@0	128	}
aoqi@0	129	if (obj instanceof CharArray) {
aoqi@0	130	CharArray cha = (CharArray)obj;
aoqi@0	131	if (length == cha.length) {
aoqi@0	132	int n = length;
aoqi@0	133	int i = start;
aoqi@0	134	int j = cha.start;
aoqi@0	135	while (n-- != 0) {
aoqi@0	136	if (ch[i++] != cha.ch[j++])
aoqi@0	137	return false;
aoqi@0	138	}
aoqi@0	139	return true;
aoqi@0	140	}
aoqi@0	141	}
aoqi@0	142	return false;
aoqi@0	143	}
aoqi@0	144
aoqi@0	145	// CharSequence interface
aoqi@0	146
aoqi@0	147	public final int length() {
aoqi@0	148	return length;
aoqi@0	149	}
aoqi@0	150
aoqi@0	151	public final char charAt(int index) {
aoqi@0	152	return ch[start + index];
aoqi@0	153	}
aoqi@0	154
aoqi@0	155	public final CharSequence subSequence(int start, int end) {
aoqi@0	156	return new CharArray(ch, this.start + start, end - start, false);
aoqi@0	157	}
aoqi@0	158	}