<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/quanquanfly</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; quanquanfly]]></copyright><item><title><![CDATA[ehcache缓存浅析]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6883108</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6883108</guid><author>quanquanfly</author><pubDate>Tue, 18 Oct 2011 01:36:35 +0800</pubDate><description><![CDATA[ehcache是一个用Java完成的运用复杂，高速，完成线程平安的缓存治理类库，ehcache供应了用内存，磁盘文件存储，以及散布式存储体式格局等多种灵敏的cache治理方案。同时ehcache作为开放源代码项目，采用限制比拟宽松的Apache License V2.0作为受权体]]></description><category></category></item><item><title><![CDATA[jdbc连接mysql数据库]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6275139</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6275139</guid><author>quanquanfly</author><pubDate>Thu, 24 Mar 2011 20:30:00 +0800</pubDate><description><![CDATA[<br />import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
public class DB {
	private Connection con;
	private PreparedStatement pstm;
	private String]]></description><category></category></item><item><title><![CDATA[jfreechart饼图]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6196878</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6196878</guid><author>quanquanfly</author><pubDate>Sun, 20 Feb 2011 23:56:00 +0800</pubDate><description><![CDATA[<br />public class PieCharts {
	private static final Font CHART_FONT = new Font("黑体", 12, 12);
	// 生成饼图数据集对象
	public PieDataset createDataset(List<Object[]> list) {
		DefaultPieDataset dataset = new DefaultPieDataset();
		int length = list.size();
		]]></description><category></category></item><item><title><![CDATA[jfreechart线性图]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6196877</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6196877</guid><author>quanquanfly</author><pubDate>Sun, 20 Feb 2011 23:52:00 +0800</pubDate><description><![CDATA[<br />1.创建数据集：<br />// 创建数据集
	public DefaultCategoryDataset getDataSetYear(List<Object[]> list,List<Object[]> sublist) {
		DefaultCategoryDataset dataset = new DefaultCategoryDataset();
		// 添加数据（数据，纵坐标，横坐标）
		dataset.addValue(0, "收入", "一月");
		return]]></description><category></category></item><item><title><![CDATA[jstl 自定义标签]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6175013</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6175013</guid><author>quanquanfly</author><pubDate>Wed, 09 Feb 2011 00:14:00 +0800</pubDate><description><![CDATA[1.package gp.business.util;
public class UtilFunction {
	
	public static String find(String name){//方法必须是public static
		return name;
	}
}2.新建tld文件：1.0]]></description><category></category></item><item><title><![CDATA[分页标签：pager-taglib使用指南]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6167207</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6167207</guid><author>quanquanfly</author><pubDate>Thu, 27 Jan 2011 20:45:00 +0800</pubDate><description><![CDATA[1  首先新建一个PageModel类package com.dengmin.oa.utils;
import java.util.List;
public class PageModel {
	/**
	 * 总记录数
	 */
	private int total;
	/**
	 * 当前页的记录集
	 */
	private List datas;
	public List getDatas() {
		return datas;
	}
	public void setDa]]></description><category></category></item><item><title><![CDATA[FSDirectory&&RAMDirectory]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6025804</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6025804</guid><author>quanquanfly</author><pubDate>Sun, 21 Nov 2010 23:13:00 +0800</pubDate><description><![CDATA[Directory fsdir = FSDirectory.getDirectory(indexpath);//物理文件，关闭后存在
		Directory ramdir = new RAMDirectory(fsdir);//缓存文件，速度快，但无法持久保存
		
		//启动时读取FSDirectory到RAMDirectory中
		IndexWriter ramiw = new IndexWriter(ramdir,a,MaxFieldLength.LIMITED);
		ramiw.ad]]></description><category></category></item><item><title><![CDATA[lucene 入门]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6025241</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6025241</guid><author>quanquanfly</author><pubDate>Sun, 21 Nov 2010 17:07:00 +0800</pubDate><description><![CDATA[<br />public class Test1 {
	Analyzer a = new StandardAnalyzer();
	final String filepath = "f://test.txt";
	final String indexpath = "D://Workspaces//MyEclipse 8.x//Lucene//luceneIndex";
	@Test
	public void cteateIndex() throws CorruptIndexException, L]]></description><category></category></item><item><title><![CDATA[无形中触动人心灵的十句诗句]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6024856</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6024856</guid><author>quanquanfly</author><pubDate>Sun, 21 Nov 2010 13:17:00 +0800</pubDate><description><![CDATA[<br /><br />“1.人生若只如初见，何事秋风悲画扇”<br /><br />如果人生的很多事，很多的境遇，很多的人，都还如初见时的模样该多好呀！若只是初见，一切美好都不会遗失。很多时候，初见，惊艳；蓦然回首，却已是物是人非，沧海桑田。。。<br /><br /><br />“2.相濡以沫，不若相忘于江湖”<br /><br />泉水就要干涸了，为了生存，两条小鱼彼此用嘴里的唾沫来喂养对方，但是，与其这样，还不如在江湖之中畅游，忘记对方的存在。很多时候，我们谴责“大难临头各自飞”，但是从理智的角度来]]></description><category></category></item><item><title><![CDATA[将excel文件导入到数据库中]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6024847</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6024847</guid><author>quanquanfly</author><pubDate>Sun, 21 Nov 2010 13:13:00 +0800</pubDate><description><![CDATA[<br />excel文件：<br /><br />File file = new File("F://test.xls");
		Connection conn = getConnection();
		Statement st = null;
		try {
			st = conn.createStatement();
		} catch (SQLException e2) {
			e2.printStackTrace();
		}
		Workbook wb;
		try {
]]></description><category></category></item><item><title><![CDATA[最“悬”的悬挂方式]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6020522</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6020522</guid><author>quanquanfly</author><pubDate>Fri, 19 Nov 2010 03:06:00 +0800</pubDate><description><![CDATA[<br /><br />把画框悬挂在钉子上，总是给人一种很不安全的感觉，如果钉子掉了的话，画框也会重重地砸在地上。像上图那样，把画框挂在两颗钉子上，看上去可就安全得多了——如果有一颗钉子掉了的话，画框仍然能够悬挂在另一颗钉子上，就好像上了双保险一样。<br />今天，我们要考大家一个完全相反的蛋疼问题——如何把画框挂在两颗钉子上，使得去掉任意一颗钉子，画框都会掉下去？<br />答案：如下图。这样缠绕绳子后，画框保证能挂稳，但少了任意一颗钉子都不行。你不妨用耳机线和两根手指头亲自试一试。<br />]]></description><category></category></item><item><title><![CDATA[字符串中出现最多的字符]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6016697</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6016697</guid><author>quanquanfly</author><pubDate>Wed, 17 Nov 2010 23:38:00 +0800</pubDate><description><![CDATA[<br />      一个字符串参数（value）由字母（a-z,A-Z）组成，且最大字符位数为40，要求写一个函数（maxLength）返回该参数中连续相同字母的最大个数及该字母，如果最大位数有多个，则返回第一个。例：字符串“aaaddxxxxddddxxxx”，返回值为：“x,4”。<br />public class Test12 {
	static String str = "aabbccaa";
	public static void getMax(int maxLength){
		ch]]></description><category></category></item><item><title><![CDATA[java读取数字问题]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6010898</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6010898</guid><author>quanquanfly</author><pubDate>Mon, 15 Nov 2010 19:05:00 +0800</pubDate><description><![CDATA[<br />在控制台输入几个成绩写入txt文档中，然后在从txt中读取出来存到数组中，再求平均值<br />import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
public ]]></description><category></category></item><item><title><![CDATA[try~catch~finally~return]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6010517</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6010517</guid><author>quanquanfly</author><pubDate>Mon, 15 Nov 2010 16:35:00 +0800</pubDate><description><![CDATA[public class OperArrayListDemo {
    public static int i = 0;
    public static int exception(){
        try {
            throw new Exception();
        }catch(Exception e){
            return ++i;
        }finally{
            System.out.println(]]></description><category></category></item><item><title><![CDATA[try~catch~finally~return答案]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6010512</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6010512</guid><author>quanquanfly</author><pubDate>Mon, 15 Nov 2010 16:35:00 +0800</pubDate><description><![CDATA[答案为：finally 2main 3over 3去掉100行之后为：finally 2main 1over 2原题地址：解析：1.首先try，catch无论触发那个，都会执行最后的finally；所以因为try中抛错，catch捕获错误，i=1，并将 i 的值压栈；执行finally的时候，打印++1，i= 2 ，得到finally 2；finally 中 return ++i ，i = 3，将 i 的值压栈，所以函数的返回值按栈先进后出原则，得到 3 ，打印 ：main 3；最后是打印： "over"+]]></description><category></category></item><item><title><![CDATA[HashSet、LinkedHashSet、TreeSet]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6003986</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6003986</guid><author>quanquanfly</author><pubDate>Fri, 12 Nov 2010 03:54:00 +0800</pubDate><description><![CDATA[三个实现了set接口的类简单介绍代码package com.test;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.TreeSet;
/**
 * @description 几个set的比较
 *    HashSet：哈希表是通过使用称为散列法的机制来存储信息的，元素并没有以某种特定顺序来存放；
 *    LinkedHashSet：以元素插入的顺序来维护集合的链接表，允许以插入的顺序]]></description><category></category></item><item><title><![CDATA[平均查找长度详解]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6003461</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6003461</guid><author>quanquanfly</author><pubDate>Thu, 11 Nov 2010 20:24:00 +0800</pubDate><description><![CDATA[<br />1.顺序查找：<br />从表的一端开始，顺序扫描线性表，依次将扫描到的节点关键字和给定值k相比较。<br />等概率条件下...平均查找长度：ASL = (n+....+2+1)/n= (n+1)/2；<br />2.二分法查找：<br />前提是线性表是有序表。假设数据是按升序排序的，对于给定值x，从序列的中间位置开始比较，如果当前位置值等于x，则查找成功；若x小于当前位置值，则在数列的前半段中查找；若x大于当前位置值则在数列的后半段中继续查找，直到找到为止。<br />在等概率条件下...]]></description><category></category></item><item><title><![CDATA[排序复杂度详解（2）]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6003202</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6003202</guid><author>quanquanfly</author><pubDate>Thu, 11 Nov 2010 17:24:00 +0800</pubDate><description><![CDATA[<br />4.冒泡排序：<br />      是一种简单的稳定的交换排序，其排序过程为：对于相邻的元素进行大小比较，如果满足排序要求，则不进行交换，否则将两个数进行交换。<br />      如序列{30, 12, 52, 23, 15, 65, 31, 58, 20,63}：<br />      以下是第一趟：30跟12比较，30>12交换位置，30<52，不交换位置，以此类推，将序列中最大的数放到最后位置，共执行n - 1次比较。共需要做 n - 1 次起泡。<br /><br />    最好]]></description><category></category></item><item><title><![CDATA[排序复杂度详解（1）]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/6002883</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/6002883</guid><author>quanquanfly</author><pubDate>Thu, 11 Nov 2010 15:44:00 +0800</pubDate><description><![CDATA[<br />稳定排序算法是指在排序过程中两个排序关键字相同的元素，在排序的过程中位置不发生变化。<br />1.直接插入排序：<br />      每次从无序表中取出第一个元素，把它插入到有序表的合适位置，使有序表仍然有序。<br />　　第一趟比较前两个数,然后把第二个数按大小插入到有序表中; 第二趟把第三个数据与前两个数从后向前扫描，把第三个数按大小插入到有序表中；依次进行下去，进行了(n-1)趟扫描以后就完成了整个排序过程，是稳定排序。<br />      <br />2.直接选择排序：<br /]]></description><category></category></item><item><title><![CDATA[递归与栈的关系]]></title><link>https://blog.youkuaiyun.com/quanquanfly/article/details/5998402</link><guid>https://blog.youkuaiyun.com/quanquanfly/article/details/5998402</guid><author>quanquanfly</author><pubDate>Tue, 09 Nov 2010 20:54:00 +0800</pubDate><description><![CDATA[递归与栈　　递归是一个重要的概念，同时也是一种重的程序设计方法。简单地说，如果在一个函数、过程或数据结构的定义中又应用了它自身(作为定义项之一)，那么这个函数、过程或数据结构称为是递归的定义的，简称递归。例如，阶乘函数可递归定义如下：　　必须注意，递归定义不能是"循环定义"。为此要求任可递归定义必须同时满足如下两个条件：　　①被定义项在定义中的应用(即作为定义项的出现)具有更小的"尺度"；　　②被定义项在最小"尺度"上的定义不是递归的。　　例如，在上述阶乘函数的定义中，被定义项n!在定义中的应用(n-1)!]]></description><category></category></item></channel></rss>