Java tutorial
/* * 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 { /** * Return <code>true</code> if the two character sequences have * the same length and the same characters. Recall that equality * is not refined in the specification of {@link CharSequence}, but * rather inherited from {@link Object#equals(Object)}. * * The related method {@link #hashCode(CharSequence)} returns * hash codes consistent with this notion of equality. * * @param cs1 First character sequence. * @param cs2 Second character sequence. * @return <code>true</code> if the character sequences yield * the same strings. */ public static boolean equalCharSequence(CharSequence cs1, CharSequence cs2) { if (cs1 == cs2) return true; int len = cs1.length(); if (len != cs2.length()) return false; for (int i = 0; i < len; ++i) if (cs1.charAt(i) != cs2.charAt(i)) return false; return true; } }