summaryrefslogtreecommitdiffstats
path: root/core/java/android/text/InputFilter.java
diff options
context:
space:
mode:
authorThe Android Open Source Project <initial-contribution@android.com>2009-03-03 18:28:45 -0800
committerThe Android Open Source Project <initial-contribution@android.com>2009-03-03 18:28:45 -0800
commitd83a98f4ce9cfa908f5c54bbd70f03eec07e7553 (patch)
tree4b825dc642cb6eb9a060e54bf8d69288fbee4904 /core/java/android/text/InputFilter.java
parent076357b8567458d4b6dfdcf839ef751634cd2bfb (diff)
downloadframeworks_base-d83a98f4ce9cfa908f5c54bbd70f03eec07e7553.zip
frameworks_base-d83a98f4ce9cfa908f5c54bbd70f03eec07e7553.tar.gz
frameworks_base-d83a98f4ce9cfa908f5c54bbd70f03eec07e7553.tar.bz2
auto import from //depot/cupcake/@135843
Diffstat (limited to 'core/java/android/text/InputFilter.java')
-rw-r--r--core/java/android/text/InputFilter.java97
1 files changed, 0 insertions, 97 deletions
diff --git a/core/java/android/text/InputFilter.java b/core/java/android/text/InputFilter.java
deleted file mode 100644
index 2f55677..0000000
--- a/core/java/android/text/InputFilter.java
+++ /dev/null
@@ -1,97 +0,0 @@
-/*
- * Copyright (C) 2006 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 android.text;
-
-/**
- * InputFilters can be attached to {@link Editable}s to constrain the
- * changes that can be made to them.
- */
-public interface InputFilter
-{
- /**
- * This method is called when the buffer is going to replace the
- * range <code>dstart &hellip; dend</code> of <code>dest</code>
- * with the new text from the range <code>start &hellip; end</code>
- * of <code>source</code>. Return the CharSequence that you would
- * like to have placed there instead, including an empty string
- * if appropriate, or <code>null</code> to accept the original
- * replacement. Be careful to not to reject 0-length replacements,
- * as this is what happens when you delete text. Also beware that
- * you should not attempt to make any changes to <code>dest</code>
- * from this method; you may only examine it for context.
- *
- * Note: If <var>source</var> is an instance of {@link Spanned} or
- * {@link Spannable}, the span objects in the <var>source</var> should be
- * copied into the filtered result (i.e. the non-null return value).
- * {@link TextUtils#copySpansFrom} can be used for convenience.
- */
- public CharSequence filter(CharSequence source, int start, int end,
- Spanned dest, int dstart, int dend);
-
- /**
- * This filter will capitalize all the lower case letters that are added
- * through edits.
- */
- public static class AllCaps implements InputFilter {
- public CharSequence filter(CharSequence source, int start, int end,
- Spanned dest, int dstart, int dend) {
- for (int i = start; i < end; i++) {
- if (Character.isLowerCase(source.charAt(i))) {
- char[] v = new char[end - start];
- TextUtils.getChars(source, start, end, v, 0);
- String s = new String(v).toUpperCase();
-
- if (source instanceof Spanned) {
- SpannableString sp = new SpannableString(s);
- TextUtils.copySpansFrom((Spanned) source,
- start, end, null, sp, 0);
- return sp;
- } else {
- return s;
- }
- }
- }
-
- return null; // keep original
- }
- }
-
- /**
- * This filter will constrain edits not to make the length of the text
- * greater than the specified length.
- */
- public static class LengthFilter implements InputFilter {
- public LengthFilter(int max) {
- mMax = max;
- }
-
- public CharSequence filter(CharSequence source, int start, int end,
- Spanned dest, int dstart, int dend) {
- int keep = mMax - (dest.length() - (dend - dstart));
-
- if (keep <= 0) {
- return "";
- } else if (keep >= end - start) {
- return null; // keep original
- } else {
- return source.subSequence(start, start + keep);
- }
- }
-
- private int mMax;
- }
-}