bo_hai的专栏

Eclipse3.6 安装EGit

原创 ThreadPoolExecutor 中饱和策略分析

hreadPoolTask(Object tasks) { this.threadPoolTaskData = tasks; } @Override public void run() { System.out.println("start :" + threadPoolTaskData); try { TimeUnit.SECONDS.sleep(consumerTaskSleepTime); } catch (Exception e)

原创 FutureTask 实例

复杂的计算。代码如下：import java.util.concurrent.Callable;import java.util.concurrent.FutureTask;import java.util.concurrent.TimeUnit;public class FutureTaskTest { private FutureTask<String> futureTask = new FutureTask<String&am

原创 ReadWriteLock 使用实例

l.Map;import java.util.concurrent.locks.Lock;import java.util.concurrent.locks.ReadWriteLock;import java.util.concurrent.locks.ReentrantReadWriteLock;public class WriteReadMap<K, V> { private final Map<K,V> map; pr

原创 安全发布单例模式

ion; }}2、使用lazy的方法：public class ResourceFactory { private ResourceFactory(){} private static class ResourceHandle{ public static Resource resource = new Resource(); } public static Resource getResource() { return ResourceFact

JAVA notifyAll wait 实例

2A34B56C78D910E ，怎么搞 ？ * @param args */ public static void main(String[] args) { int[] numArr = {1,2,3,4,5,6,7,8,9,10}; char[] charArr = {'A','B','C','D','E'}; NotifyAllTest obj = new NotifyAllTest(); new Thread(new OneThread(numArr, ob

获取机器CPU数量的方法

返回的结果就是机器CPU的个数。

动态代理的实现

lic void sayHello() { System.out.println("Hello World"); } @Override public void sayBye() { System.out.println("Bye"); } @Override public void saySomething(String msg) { System.out.println("I want to say :I

线程同步优化实例

JavaScript 遍历JSON 获取key value

y]); } }} subProdInfoJson 是JSON格式的字条串。

计算器算法（支持加减乘除括号）

List<String>houzhuishi = houzhui("(0.006+(3-1))/(2+1)+3*2"); //List<String>houzhuishi = houzhui("(600+(30000-1))/(2+1)+3*2"); //Double a = Calucate.recursiveCalStr("6+(3-1)/(2+1)+3*2"); Sy

实用工具类 && CollectionUtils

tions.CollectionUtils;import org.apache.commons.lang.StringUtils;import com.ibatis.common.beans.Probe;import com.ibatis.common.beans.ProbeFactory;/** * <pre> * * </pre> * * @author liuhongbo * @version $

原创 解决fatal: unable to connect to github.com问题

-jquery.ruble'...fatal: unable to connect to github.com:github.com[0: 你的IP]: errno=No error 今天终于找到解决办法了，执行下面的命令及可：git config --global url."https://".insteadOf git://  参考：http://blog.csdn.net/greenqingqingws/article/details/11808745 

GIT 去掉右键菜单方法

原创 JAVA多线程 Semaphore 应用

public static void main(String[] args) { // 线程池 ExecutorService exec = Executors.newCachedThreadPool(); // 只能5个线程同时访问 final Semaphore semp = new Semaphore(5); // 模拟20个客户端访问 for (int index = 0; index < 20; index++) { final in

原创 JAVA多线程 Exchanger 应用

有空杯中不断倒水，消费者不断从原有装满水的杯中喝水。 * 当服务员倒满水和消费者喝完水时，两个杯子进行交换。一直这样周而复始。 * @author liuhongbo * */public class ExchargerTest { static Exchanger<Cup> exchanger = new Exchanger<Cup>(); // 初始化时，100 只杯子都是满的 static Cup fu

Eclipse字体修改

原创 JAVA多线程CyclicBarrier应用

原创 CountDownLatch 应用实例

Condition 在多线程协作中应用实例

til.concurrent.locks.Lock;import java.util.concurrent.locks.ReentrantLock;public class NewPlate { private List<Object> eggs = new ArrayList<Object>(); private Lock lock = new ReentrantLock(); private Conditio

一个容易产生死锁的线程协作

Thread(Plate plate) { this.plate = plate; } @Override public void run() { plate.addEgg(egg); } } public class GetEggThread implements Runnable { private Plate plate; public GetEggThread(Plate plate) { this.plate = plate;

JAVA 线程执行返回结果

urrent.Future;public class TaskWithResult implements Callable<String> { private int id ; public TaskWithResult(int id) { this.id = id; } @Override public String call() throws Exception { return "result of TaskWit

多线程产生偶数实例

this.cancel = true; } public boolean isCancel() { return this.cancel; }} import java.util.concurrent.ExecutorService;import java.util.concurrent.Executors;/** * 校验是否为偶数 * */public class EvenChecker implements Runnable {

二叉排序树使用List 实现（JAVA）

.List;public class BinaryTreeList<E> extends AbstractSingleLinkedList<E> implements List<E> ,java.io.Serializable { private static final long serialVersionUID = -5672690815694732101L; private Entry&lt

队列（Queue）用JAVA简单实现

te static final long serialVersionUID = 6203363761107460505L; // 指向队头 private transient Entry<E> front; private transient int size ; // 指向队尾 private transient Entry<E> rear; @Override public Iterator&l

Stack （堆栈）使用JAVA实现

bstractList<E>implements List<E>, RandomAccess, Cloneable, java.io.Serializable{ private static final long serialVersionUID = 1L; private Object[] elementData; private int size; private int length; publ

循环单向链表JAVA实现

tSingleLinkedList<E> implements List<E> ,java.io.Serializable { private static final long serialVersionUID = -2856058002090891038L; private transient Entry<E> header = null; private transient int size ;

非循环单向链表JAVA实现

tor<E> { boolean hasNext(); E next(); void remove(); void set(E e); void add(E e);} 二、链表实现如下：import java.util.List;public class SingleLinkedList<E> extends AbstractSingleLinkedList<E&

二分查找的两种实现方法

high；另一种方法是：使用递归，结束条件也是：low > high。代码如下：public class BinarySearchTest { public static void main(String[] args) { int arr[] = new int[10]; int data = -1; for (int i = 1; i <= 10;i++) { arr[i - 1] = i; } SortUtil.showA

斐波那契数列 的两种实现方式

快速排序的简单实例

tUtil.showArr(arr); } public static void quickSort(int[] arr,int low ,int high) { int i = low; int j = high; int temp = arr[i]; while(i < j) { while (i < j && temp < arr[j]) { j--; } i

判断是否是回文数的简单实例

(i))) { n++; System.out.print(i); System.out.print('\t'); if (n % 5 == 0) { System.out.println(); } } } } public static boolean isPalindrome(String str) { boolean result = true; int length = str.length();

插入排序、选择排序、冒泡排序 简单实例

用JAVA 解决 约瑟夫环问题的两种办法

DataJoin 实例

port org.apache.hadoop.conf.Configured;import org.apache.hadoop.contrib.utils.join.DataJoinMapperBase;import org.apache.hadoop.contrib.utils.join.DataJoinReducerBase;import org.apache.hadoop.contrib.utils.join.TaggedMapOutput;import org.apache.hado

List 原地逆转

emp = list.get(i); list.set(i, list.get(size - 1 -i)); list.set((size - 1 -i), temp); } } return list;} 

hive 操作专利数据笔记

imit 10;create table cite_count(cited int ,count int);insert overwrite table cite_count select cited,count(citing) from cite group by cited;select * from cite_count limit 10;alter table cited_count rename to cite_count;create table cit

分享：从Map中根据key批量获取Values的方法

s.isEmpty() && source != null && !source.isEmpty()) { values = new ArrayList<V>(); for (K k : keys) { values.add(source.get(k)); } } return values;} 

讨论：如何高效使用List

List 中去除 null 方法讨论

ys.add(null); arrays.add(789); System.out.println(arrays);} 注：一个list，向其中插入数据时，也插入一些null。程序输出如下：  [2, null, 456, null, 789] 现在有这个需求：去除list中null 元素。尝试的代码如下：  public static void main(String[] args) { List<Integer> arrays