android mergecursor 排序,Android查询cursor之后对齐进行排序

按Android默认的方法进行排序总是感觉不理想,

需要导入一个jar包,下载地址:http://download.csdn.net/detail/u010272238/7958785

工具类如下:

import java.util.ArrayList;

import java.util.Collections;

import java.util.Comparator;

import net.sourceforge.pinyin4j.PinyinHelper;

import android.database.Cursor;

import android.database.CursorWrapper;

public class SortCursorUtil extends CursorWrapper {

Cursor mCursor;

ArrayList sortList = new ArrayList();

int mPos = 0;

public class SortEntry {

public String key;

public int order;

}

public Comparator comparator = new Comparator() {

@Override

public int compare(SortEntry entry1, SortEntry entry2) {

for (int i = 0; i < entry1.key.length() && i < entry2.key.length(); i++) {

int codePoint1 = entry1.key.charAt(i);

int codePoint2 = entry2.key.charAt(i);

if (Character.isSupplementaryCodePoint(codePoint1)

|| Character.isSupplementaryCodePoint(codePoint2)) {

i++;

}

if (codePoint1 != codePoint2) {

if (Character.isSupplementaryCodePoint(codePoint1)

|| Character.isSupplementaryCodePoint(codePoint2)) {

return codePoint1 - codePoint2;

}

String pinyin1 = pinyin((char) codePoint1);

String pinyin2 = pinyin((char) codePoint2);

if (pinyin1 != null && pinyin2 != null) {

if (!pinyin1.equals(pinyin2)) {

return pinyin1.compareTo(pinyin2);

}

} else {

return codePoint1 - codePoint2;

}

}

}

return entry1.key.length() - entry2.key.length();

}

};

public SortCursorUtil(Cursor cursor, String columnName) {

super(cursor);

mCursor = cursor;

if (mCursor != null && mCursor.getCount() > 0) {

int i = 0;

int column = cursor.getColumnIndexOrThrow(columnName);

for (mCursor.moveToFirst(); !mCursor.isAfterLast(); mCursor.moveToNext(), i++) {

SortEntry sortKey = new SortEntry();

sortKey.key = cursor.getString(column);

sortKey.order = i;

sortList.add(sortKey);

}

}

Collections.sort(sortList, comparator);

// StringBuffer stringBuffer = new StringBuffer();

// for (SortEntry sortKey : sortList) {

// stringBuffer.append(sortKey.key + ";");

// }

// Log.d("SampleActivity--------排序后----", stringBuffer.toString());

}

public boolean moveToPosition(int position) {

if (position >= 0 && position < sortList.size()) {

mPos = position;

int order = sortList.get(position).order;

return mCursor.moveToPosition(order);

}

if (position < 0) {

mPos = -1;

}

if (position >= sortList.size()) {

mPos = sortList.size();

}

return mCursor.moveToPosition(position);

}

public boolean moveToFirst() {

return moveToPosition(0);

}

public boolean moveToLast() {

return moveToPosition(getCount() - 1);

}

public boolean moveToNext() {

return moveToPosition(mPos + 1);

}

public boolean moveToPrevious() {

return moveToPosition(mPos - 1);

}

public boolean move(int offset) {

return moveToPosition(mPos + offset);

}

public int getPosition() {

return mPos;

}

private String pinyin(char c) {

String[] pinyins = PinyinHelper.toHanyuPinyinStringArray(c);

if (pinyins == null) {

return null;

}

return pinyins[0];

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值