FSearchTool.java 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134
  1. package com.it.ocs.salesStatistics.utils;
  2. import java.lang.reflect.Field;
  3. import java.util.ArrayList;
  4. import java.util.List;
  5. import java.util.regex.Matcher;
  6. import java.util.regex.Pattern;
  7. public class FSearchTool {
  8. private StringBuffer mKeyWordString = new StringBuffer();
  9. private List<Object> mSearchObjs = new ArrayList<>();
  10. private int[] mIndexes;
  11. public FSearchTool(List<? extends Object> objects, String... fields) throws Exception {
  12. super();
  13. init(objects, fields);
  14. }
  15. private void init(List<? extends Object> objs, String... fields) throws Exception {
  16. if (objs != null) {
  17. mKeyWordString.setLength(0);
  18. mSearchObjs.clear();
  19. mSearchObjs = new ArrayList<>(objs);
  20. mIndexes = new int[mSearchObjs.size() * 2];
  21. int index = 0;
  22. for (int i = 0; i < mSearchObjs.size(); i++) {
  23. Object info = mSearchObjs.get(i);
  24. // 指定要搜索的字段
  25. String searchKey = getSearchKey(info, fields);
  26. // 将该字符串在总字符串中的起终位置保存下来,位置是索引值而非长度
  27. int length = mKeyWordString.length();
  28. mIndexes[index] = length;
  29. mKeyWordString.append(searchKey);
  30. length = mKeyWordString.length();
  31. index++;
  32. // 保存新加搜索字段的索引值
  33. mIndexes[index] = (length > 0) ? length - 1 : 0;
  34. index++;
  35. }
  36. }
  37. }
  38. /**
  39. * 通过反射从对象中取出指定字段的值
  40. */
  41. private String getSearchKey(Object obj, String... fields) throws Exception {
  42. StringBuilder searchKeys = new StringBuilder();
  43. Class<? extends Object> clazz = obj.getClass();
  44. try {
  45. for (String str : fields) {
  46. // 搜索字段使用空格隔开
  47. Field f = clazz.getDeclaredField(str);
  48. f.setAccessible(true);
  49. Object val = f.get(obj);
  50. searchKeys.append(val).append(" ");
  51. f.setAccessible(false);
  52. }
  53. } catch (Exception e) {
  54. throw new Exception("取值异常:" + e.getMessage());
  55. }
  56. return searchKeys.toString();
  57. }
  58. /**
  59. * 搜索结果
  60. *
  61. * @param keyWords搜索的关键字,要去掉首尾的空格
  62. * @return 返回搜索到的对象
  63. */
  64. public <E> List<E> searchTasks(String keyWords) {
  65. List<E> searchedTask = new ArrayList<>();
  66. int[] searchIndex = getSearchIndex(keyWords);
  67. for (int index : searchIndex) {
  68. if (index != -1 && index < mSearchObjs.size() * 2) {
  69. E e = (E) mSearchObjs.get(index / 2);
  70. if (e != null && !searchedTask.contains(e)) {
  71. searchedTask.add(e);
  72. }
  73. }
  74. }
  75. return searchedTask;
  76. }
  77. /**
  78. * 找到匹配的索引数据
  79. *
  80. * @param keyWords
  81. * 搜索的关键字
  82. * @return 在初始化的索引数组的下标数组
  83. */
  84. private int[] getSearchIndex(String keyWords) {
  85. Pattern pattern = Pattern.compile(keyWords, Pattern.CASE_INSENSITIVE | Pattern.LITERAL);
  86. Matcher matcher = pattern.matcher(mKeyWordString.toString());
  87. ArrayList<Integer> searchResult = new ArrayList<>();
  88. while (matcher.find()) {
  89. // 不宜在此处再做循环,否则可能造成循环次数过多错误
  90. searchResult.add(matcher.start());
  91. }
  92. int[] searchIndexes = new int[searchResult.size()];
  93. for (int i = 0; i < searchIndexes.length; i++) {
  94. int findIndex = findIndex(searchResult.get(i));
  95. searchIndexes[i] = (findIndex / 2) * 2;
  96. }
  97. return searchIndexes;
  98. }
  99. /*
  100. * 使用二分法找到指定字符位置在索引数组中的位置
  101. *
  102. * @param charAt 字符在整个字符串中的位置
  103. *
  104. * @return 在索引数组中的位置
  105. */
  106. private int findIndex(int charAt) {
  107. int low = 0;
  108. int high = mIndexes.length - 1;
  109. int mid = -1;
  110. while (low <= high) {
  111. mid = (low + high) >>> 1;
  112. int midVal = mIndexes[mid];
  113. if (midVal < charAt) {
  114. low = mid + 1;
  115. } else if (midVal > charAt) {
  116. high = mid - 1;
  117. } else {
  118. return mid;
  119. }
  120. }
  121. return mid;
  122. }
  123. }