ReVanced/smali
1
0
Fork 0
mirror of https://github.com/revanced/smali.git synced 2025-06-13 04:27:38 +02:00
Code Issues Packages Projects Releases Wiki Activity

whitespace changes

Browse Source 
git-svn-id: https://smali.googlecode.com/svn/trunk@573 55b6fa8a-2a1e-11de-a435-ffa8d773f76a
This commit is contained in:
JesusFreke@JesusFreke.com
2010-01-24 00:55:05 +00:00
parent baabf9a11b
commit 2d5d83efca
1 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
dexlib/src/main/java/org/jf/dexlib/Util/SparseArray.java
View File

@ -180,7 +180,7 @@ public class SparseArray<E> {
/** /**
* Given an index in the range <code>0...size()-1</code>, returns * Given an index in the range <code>0...size()-1</code>, returns
* the key from the <code>index</code>th key-value mapping that this * the key from the <code>index</code>th key-value mapping that this
* SparseArray stores. * SparseArray stores.
*/ */
public int keyAt(int index) { public int keyAt(int index) {
if (mGarbage) { if (mGarbage) {
@ -189,11 +189,11 @@ public class SparseArray<E> {
return mKeys[index]; return mKeys[index];
} }
/** /**
* Given an index in the range <code>0...size()-1</code>, returns * Given an index in the range <code>0...size()-1</code>, returns
* the value from the <code>index</code>th key-value mapping that this * the value from the <code>index</code>th key-value mapping that this
* SparseArray stores. * SparseArray stores.
*/ */
public E valueAt(int index) { public E valueAt(int index) {
if (mGarbage) { if (mGarbage) {
@ -206,7 +206,7 @@ public class SparseArray<E> {
/** /**
* Given an index in the range <code>0...size()-1</code>, sets a new * Given an index in the range <code>0...size()-1</code>, sets a new
* value for the <code>index</code>th key-value mapping that this * value for the <code>index</code>th key-value mapping that this
* SparseArray stores. * SparseArray stores.
*/ */
public void setValueAt(int index, E value) { public void setValueAt(int index, E value) {
if (mGarbage) { if (mGarbage) {
@ -215,7 +215,7 @@ public class SparseArray<E> {
mValues[index] = value; mValues[index] = value;
} }
/** /**
* Returns the index for which {@link #keyAt} would return the * Returns the index for which {@link #keyAt} would return the
* specified key, or a negative number if the specified * specified key, or a negative number if the specified
@ -300,7 +300,7 @@ public class SparseArray<E> {
/** /**
* Increases the size of the underlying storage if needed, to ensure that it can * Increases the size of the underlying storage if needed, to ensure that it can
* hold the specified number of items without having to allocate additional memory * hold the specified number of items without having to allocate additional memory
* @param capacity the number of items * @param capacity the number of items
*/ */
public void ensureCapacity(int capacity) { public void ensureCapacity(int capacity) {
@ -319,7 +319,7 @@ public class SparseArray<E> {
mValues = nvalues; mValues = nvalues;
} }
} }
private static int binarySearch(int[] a, int start, int len, int key) { private static int binarySearch(int[] a, int start, int len, int key) {
int high = start + len, low = start - 1, guess; int high = start + len, low = start - 1, guess;