CursorLoaderListFragment

Solr是一个独立的企业级搜索应用服务器，它对外提供类似于Web-service的API接口。用户可以通过http请求，向搜索引擎服务器提交一定格式的XML文件，生成索引；也可以通过Http Get操作提出查找请求，并得到XML格式的返回结果(Solr is an independent enterprise search application server, which provides API interface similar to Web-service. Users can submit XML files in a certain format to search engine servers through HTTP requests and generate indexes. Users can also submit search requests through Http Get operations and get the returned results in XML format.)

video前端模板,有待开发,开发完,就能用,啊啊啊啊啊啊啊(Vieo front-end template, to be developed, developed, can be used, ah ah ah ah ah ah ah ah ah ah ah ah)

JAVA几个最著名的开源项目的介绍，内容丰富，可以开拓视野(JAVA several of the most famous open source project introduction, content-rich, can broaden their horizons)

关于Javaweb的仓库系统源代码，希望大家能看看发现错误(Warehouse system source code)

网上购书系统，本科毕设。内容齐全，可供本科毕设借鉴，希望能提供帮助。采用了struts2框架+tomcat+sqlsever2000(online book shop)

JAVA版的聊天界面，方便局域网的人进行聊天(JAVA version of the chat interface, convenient LAN chat)

Java设计实例100例，希望有助于你学习JAVA(The utility program design 100 cases of java)

repast city模型，在repast s平台搭建预测模型(repast city model in repast S)

直接运行compile.bat和run.bat即可 使用了3种分词方法： 1.正向最大匹配(ForwardMatch.java) 2.逆向最大匹配(ForwardMatch.java) 3.最大频率匹配(FrequencyMatch.java)(默认) 取频率最高的词，然后两端递归，构建二杈树存储句子中的词语，显示的时候使用中序遍历二杈树 由于极有可能单个字的使用频率比整个词还高，筛选的时候进行了处理 若单个字不处于当前句子开头，先忽略， 若单个的字处在开头，临时mostFrequency仍为0，且单词长度为1，则加入到二杈树中(Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree)

this is implementation paint of some shape