summaryrefslogtreecommitdiff
path: root/java/com/android/contacts/common/format/FormatUtils.java
blob: 727c15b83032f4bcb0c8d5cf17101bc30e1ca821 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
/*
 * 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.android.contacts.common.format;

import android.database.CharArrayBuffer;
import android.graphics.Typeface;
import android.support.annotation.VisibleForTesting;
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 {

  /**
   * 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.
   */
  @VisibleForTesting
  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;
  }

  @VisibleForTesting
  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}. */
  @VisibleForTesting
  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, String 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.charAt(j)) {
          break;
        }
      }
      if (j == prefixLength) {
        return i;
      }

      // Skip this word
      while (i < textLength && Character.isLetterOrDigit(text.charAt(i))) {
        i++;
      }
    }

    return -1;
  }
}