/*
* LingPipe v. 3.9
* Copyright (C) 2003-2010 Alias-i
*
* This program is licensed under the Alias-i Royalty Free License
* Version 1 WITHOUT ANY WARRANTY, without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Alias-i
* Royalty Free License Version 1 for more details.
*
* You should have received a copy of the Alias-i Royalty Free License
* Version 1 along with this program; if not, visit
* http://alias-i.com/lingpipe/licenses/lingpipe-license-1.txt or contact
* Alias-i, Inc. at 181 North 11th Street, Suite 401, Brooklyn, NY 11211,
* +1 (718) 290-9170.
*/
//package com.aliasi.util;
import java.io.DataInput;
import java.io.DataOutput;
import java.io.IOException;
import java.text.DecimalFormat;
/**
* Static utility methods for processing strings, characters and
* string buffers.
*
* @author Bob Carpenter
* @version 4.0.1
* @since LingPipe1.0
* @see java.lang.Character
* @see java.lang.String
* @see java.lang.StringBuilder
*/
public class Strings {
/**
* Returns a hash code for a character sequence that is equivalent
* to the hash code generated for a its string yield. Recall that
* the interface {@link CharSequence} does not refine the definition
* of equality beyond that of {@link Object#equals(Object)}.
*
* The return result is the same as would be produced by:
*
*
* hashCode(cSeq) = cSeq.toString().hashCode()
*
* Recall that the {@link CharSequence} interface requires its
* {@link CharSequence#toString()} to return a string
* corresponding to its characters as returned by
* charAt(0),...,charAt(length()-1)
. This value
* can be defined directly by inspecting the hash code for strings:
*
*
* int h = 0;
* for (int i = 0; i < cSeq.length(); ++i)
* h = 31*h + cSeq.charAt(i);
* return h;
*
* @param cSeq The character sequence.
* @return The hash code for the specified character sequence.
*/
public static int hashCode(CharSequence cSeq) {
if (cSeq instanceof String) return cSeq.hashCode();
int h = 0;
for (int i = 0; i < cSeq.length(); ++i)
h = 31*h + cSeq.charAt(i);
return h;
}
}