/*
Copyright © 2013-2014, Silent Circle, LLC.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Any redistribution, use, or modification is done solely for personal
benefit and not for any commercial purpose or for monetary gain
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name Silent Circle nor the names of its contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL SILENT CIRCLE, LLC BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* This implementation is edited version of original Android sources.
*/
/*
* Copyright (C) 2011 The Android Open Source Project
*
* Licensed 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 com.silentcircle.contacts.utils;
import android.database.CharArrayBuffer;
import android.graphics.Typeface;
import android.text.SpannableString;
import android.text.style.StyleSpan;
import java.util.Arrays;
/**
* Assorted utility methods related to text formatting in Contacts.
*/
public class FormatUtils {
private static final char LEFT_TO_RIGHT_EMBEDDING = '\u202A';
private static final char POP_DIRECTIONAL_FORMATTING = '\u202C';
/**
* Finds the earliest point in buffer1 at which the first part of buffer2 matches. For example,
* overlapPoint("abcd", "cdef") == 2.
*/
public static int overlapPoint(CharArrayBuffer buffer1, CharArrayBuffer buffer2) {
if (buffer1 == null || buffer2 == null) {
return -1;
}
return overlapPoint(Arrays.copyOfRange(buffer1.data, 0, buffer1.sizeCopied),
Arrays.copyOfRange(buffer2.data, 0, buffer2.sizeCopied));
}
/**
* Finds the earliest point in string1 at which the first part of string2 matches. For example,
* overlapPoint("abcd", "cdef") == 2.
*/
public static int overlapPoint(String string1, String string2) {
if (string1 == null || string2 == null) {
return -1;
}
return overlapPoint(string1.toCharArray(), string2.toCharArray());
}
/**
* Finds the earliest point in array1 at which the first part of array2 matches. For example,
* overlapPoint("abcd", "cdef") == 2.
*/
public static int overlapPoint(char[] array1, char[] array2) {
if (array1 == null || array2 == null) {
return -1;
}
int count1 = array1.length;
int count2 = array2.length;
// Ignore matching tails of the two arrays.
while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) {
count1--;
count2--;
}
int size = count2;
for (int i = 0; i < count1; i++) {
if (i + size > count1) {
size = count1 - i;
}
int j;
for (j = 0; j < size; j++) {
if (array1[i+j] != array2[j]) {
break;
}
}
if (j == size) {
return i;
}
}
return -1;
}
/**
* Applies the given style to a range of the input CharSequence.
* @param style The style to apply (see the style constants in {@link Typeface}).
* @param input The CharSequence to style.
* @param start Starting index of the range to style (will be clamped to be a minimum of 0).
* @param end Ending index of the range to style (will be clamped to a maximum of the input
* length).
* @param flags Bitmask for configuring behavior of the span. See {@link android.text.Spanned}.
* @return The styled CharSequence.
*/
public static CharSequence applyStyleToSpan(int style, CharSequence input, int start, int end,
int flags) {
// Enforce bounds of the char sequence.
start = Math.max(0, start);
end = Math.min(input.length(), end);
SpannableString text = new SpannableString(input);
text.setSpan(new StyleSpan(style), start, end, flags);
return text;
}
public static void copyToCharArrayBuffer(String text, CharArrayBuffer buffer) {
if (text != null) {
char[] data = buffer.data;
if (data == null || data.length < text.length()) {
buffer.data = text.toCharArray();
} else {
text.getChars(0, text.length(), data, 0);
}
buffer.sizeCopied = text.length();
} else {
buffer.sizeCopied = 0;
}
}
/** Returns a String that represents the content of the given {@link CharArrayBuffer}. */
public static String charArrayBufferToString(CharArrayBuffer buffer) {
return new String(buffer.data, 0, buffer.sizeCopied);
}
/**
* Finds the index of the first word that starts with the given prefix.
* <p>
* If not found, returns -1.
*
* @param text the text in which to search for the prefix
* @param prefix the text to find, in upper case letters
*/
public static int indexOfWordPrefix(CharSequence text, char[] prefix) {
if (prefix == null || text == null) {
return -1;
}
int textLength = text.length();
int prefixLength = prefix.length;
if (prefixLength == 0 || textLength < prefixLength) {
return -1;
}
int i = 0;
while (i < textLength) {
// Skip non-word characters
while (i < textLength && !Character.isLetterOrDigit(text.charAt(i))) {
i++;
}
if (i + prefixLength > textLength) {
return -1;
}
// Compare the prefixes
int j;
for (j = 0; j < prefixLength; j++) {
if (Character.toUpperCase(text.charAt(i + j)) != prefix[j]) {
break;
}
}
if (j == prefixLength) {
return i;
}
// Skip this word
while (i < textLength && Character.isLetterOrDigit(text.charAt(i))) {
i++;
}
}
return -1;
}
/** Returns the given text, forced to be left-to-right. */
public static CharSequence forceLeftToRight(CharSequence text) {
StringBuilder sb = new StringBuilder();
sb.append(LEFT_TO_RIGHT_EMBEDDING);
sb.append(text);
sb.append(POP_DIRECTIONAL_FORMATTING);
return sb.toString();
}
}