set和queue集合的demo

chenweijie · chenweijie · commit 2e2b959d8611 · 2019-08-15T16:41:12.000+08:00
diff --git a/src/main/java/com/chen/dataStructure/self/array/MyArray.java b/src/main/java/com/chen/dataStructure/self/array/MyArray.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.array;
+package com.chen.dataStructure.self.array;
 
 /**
  * @author :  chen weijie
diff --git a/src/main/java/com/chen/dataStructure/self/hash/HashChain.java b/src/main/java/com/chen/dataStructure/self/hash/HashChain.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.hash;
+package com.chen.dataStructure.self.hash;
 
 /**
  * @author :  chen weijie
diff --git a/src/main/java/com/chen/dataStructure/self/hash/HashDouble.java b/src/main/java/com/chen/dataStructure/self/hash/HashDouble.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.hash;
+package com.chen.dataStructure.self.hash;
 
 /**
  * 再hash算法
diff --git a/src/main/java/com/chen/dataStructure/self/hash/MyHashTable.java b/src/main/java/com/chen/dataStructure/self/hash/MyHashTable.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.hash;
+package com.chen.dataStructure.self.hash;
 
 /**
  *  线性探测
diff --git a/src/main/java/com/chen/dataStructure/self/hash/SortLink.java b/src/main/java/com/chen/dataStructure/self/hash/SortLink.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.hash;
+package com.chen.dataStructure.self.hash;
 
 /**
  * 有序链表
diff --git a/src/main/java/com/chen/dataStructure/self/heap/Heap.java b/src/main/java/com/chen/dataStructure/self/heap/Heap.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.heap;
+package com.chen.dataStructure.self.heap;
 
 /**
  * 堆
diff --git a/src/main/java/com/chen/dataStructure/self/linklistnode/SingleLinkedList.java b/src/main/java/com/chen/dataStructure/self/linklistnode/SingleLinkedList.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.linklistnode;
+package com.chen.dataStructure.self.linklistnode;
 
 /**
  * 单链表的具体实现
diff --git a/src/main/java/com/chen/dataStructure/self/linklistnode/StackSingleLink.java b/src/main/java/com/chen/dataStructure/self/linklistnode/StackSingleLink.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.linklistnode;
+package com.chen.dataStructure.self.linklistnode;
 
 /**
  * 用单向链表实现栈
diff --git a/src/main/java/com/chen/dataStructure/self/linknode/DoublePointLinkedList.java b/src/main/java/com/chen/dataStructure/self/linknode/DoublePointLinkedList.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.linknode;
+package com.chen.dataStructure.self.linknode;
 
 /**
  * 双端队列
diff --git a/src/main/java/com/chen/dataStructure/self/linknode/LinkNodeTest.java b/src/main/java/com/chen/dataStructure/self/linknode/LinkNodeTest.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.linknode;
+package com.chen.dataStructure.self.linknode;
 
 /**
  * http://blog.csdn.net/guyuealian/article/details/51119499(单链表的反转)
diff --git a/src/main/java/com/chen/dataStructure/self/linknode/Node.java b/src/main/java/com/chen/dataStructure/self/linknode/Node.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.linknode;
+package com.chen.dataStructure.self.linknode;
 
 /**
  * @Author chenweijie
diff --git a/src/main/java/com/chen/dataStructure/self/linknode/TwoWayLinkedList.java b/src/main/java/com/chen/dataStructure/self/linknode/TwoWayLinkedList.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.linknode;
+package com.chen.dataStructure.self.linknode;
 
 /**
  * 双向链表
diff --git a/src/main/java/com/chen/dataStructure/self/queue/MyQueue.java b/src/main/java/com/chen/dataStructure/self/queue/MyQueue.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.queue;
+package com.chen.dataStructure.self.queue;
 
 /**
  * @author :  chen weijie
diff --git a/src/main/java/com/chen/dataStructure/self/queue/PriorityQue.java b/src/main/java/com/chen/dataStructure/self/queue/PriorityQue.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.queue;
+package com.chen.dataStructure.self.queue;
 
 /**
  * @author :  chen weijie
diff --git a/src/main/java/com/chen/dataStructure/self/stack/ArrayStack.java b/src/main/java/com/chen/dataStructure/self/stack/ArrayStack.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.stack;
+package com.chen.dataStructure.self.stack;
 
 import java.util.Arrays;
 
diff --git a/src/main/java/com/chen/dataStructure/self/stack/MyStack.java b/src/main/java/com/chen/dataStructure/self/stack/MyStack.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.stack;
+package com.chen.dataStructure.self.stack;
 
 /**
  * @author :  chen weijie
diff --git a/src/main/java/com/chen/dataStructure/self/stack/RevertString.java b/src/main/java/com/chen/dataStructure/self/stack/RevertString.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.stack;
+package com.chen.dataStructure.self.stack;
 
 /**
  * 利用栈实现字符串逆序
diff --git a/src/main/java/com/chen/dataStructure/self/stack/TestMatch.java b/src/main/java/com/chen/dataStructure/self/stack/TestMatch.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.stack;
+package com.chen.dataStructure.self.stack;
 
 /**
  * 利用栈判断分隔符是否匹配
diff --git a/src/main/java/com/chen/dataStructure/self/tree/BinaryTree.java b/src/main/java/com/chen/dataStructure/self/tree/BinaryTree.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.tree;
+package com.chen.dataStructure.self.tree;
 
 /**
  * 二叉树搜索树
diff --git a/src/main/java/com/chen/dataStructure/self/tree/Node.java b/src/main/java/com/chen/dataStructure/self/tree/Node.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.tree;
+package com.chen.dataStructure.self.tree;
 
 /**
  * @author :  chen weijie
diff --git a/src/main/java/com/chen/dataStructure/self/tree/Tree.java b/src/main/java/com/chen/dataStructure/self/tree/Tree.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.tree;
+package com.chen.dataStructure.self.tree;
 
 /**
  * @author :  chen weijie
diff --git a/src/main/java/com/chen/dataStructure/self/tree/rbtree/RBNode.java b/src/main/java/com/chen/dataStructure/self/tree/rbtree/RBNode.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure.tree.rbtree;
+package com.chen.dataStructure.self.tree.rbtree;
 
 /**
  * 红黑树节点类
diff --git a/src/main/java/com/chen/dataStructure/study/queen/DequeTest.java b/src/main/java/com/chen/dataStructure/study/queen/DequeTest.java
@@ -0,0 +1,36 @@
+package com.chen.dataStructure.study.queen;
+
+import java.util.concurrent.LinkedBlockingDeque;
+
+/**
+ * @author :  chen weijie
+ * @Date: 2019-08-15 00:13
+ */
+public class DequeTest {
+
+
+    public static void main(String[] args) {
+
+
+        LinkedBlockingDeque<String> dq = new LinkedBlockingDeque<String>(10);
+        dq.addFirst("a");
+        dq.addFirst("b");
+        dq.addFirst("c");
+        dq.addFirst("d");
+        dq.addFirst("e");
+        dq.addLast("f");
+        dq.addLast("g");
+        dq.addLast("h");
+        dq.addLast("i");
+        dq.addLast("j");
+        //dq.offerFirst("k");
+        System.out.println("查看头元素：" + dq.peekFirst());
+        System.out.println("获取尾元素：" + dq.pollLast());
+        Object [] objs = dq.toArray();
+        for (int i = 0; i < objs.length; i++) {
+            System.out.print(objs[i] + " -- ");
+        }
+
+    }
+
+}
diff --git a/src/main/java/com/chen/dataStructure/study/queen/UseQueue_BlockingQueue.java b/src/main/java/com/chen/dataStructure/study/queen/UseQueue_BlockingQueue.java
@@ -0,0 +1,78 @@
+package com.chen.dataStructure.study.queen;
+
+import java.util.ArrayList;
+import java.util.Iterator;
+import java.util.List;
+import java.util.concurrent.ArrayBlockingQueue;
+import java.util.concurrent.LinkedBlockingQueue;
+import java.util.concurrent.SynchronousQueue;
+
+/**
+ * @author :  chen weijie
+ * @Date: 2019-08-14 23:17
+ */
+public class UseQueue_BlockingQueue {
+
+
+    public static void main(String[] args) throws InterruptedException {
+
+
+        ArrayBlockingQueue<String> arrayBlockingQueue = new ArrayBlockingQueue<>(5);
+
+        arrayBlockingQueue.add("a");
+        arrayBlockingQueue.add("b");
+        arrayBlockingQueue.add("c");
+        arrayBlockingQueue.add("d");
+        arrayBlockingQueue.offer("e");
+//        System.out.println(arrayBlockingQueue.offer("f",4, TimeUnit.SECONDS));
+        System.out.println("打印数据：" + arrayBlockingQueue.toString());
+
+        LinkedBlockingQueue<String> linkedBlockingQueue = new LinkedBlockingQueue<>();
+
+
+        linkedBlockingQueue.offer("a");
+        linkedBlockingQueue.offer("b");
+        linkedBlockingQueue.offer("c");
+        linkedBlockingQueue.offer("d");
+        linkedBlockingQueue.offer("e");
+        linkedBlockingQueue.add("f");
+
+        for (Iterator iterator = linkedBlockingQueue.iterator(); iterator.hasNext(); ) {
+            String string = (String) iterator.next();
+            System.out.println(string + " -- ");
+        }
+
+
+        List<String> list = new ArrayList<>();
+
+        linkedBlockingQueue.drainTo(list, 2);
+
+        System.out.println("取出LinkedBlockingQueue数据放到list列表的长度为   >>  " + list.size());
+        for (String string : list) {
+            System.out.println(string + " -- ");
+        }
+
+
+        System.out.println("--------------- SynchronousQueue --------------");
+
+        SynchronousQueue<String> stringSynchronousQueue = new SynchronousQueue<>();
+
+        new Thread(() -> {
+            try {
+                System.out.println(Thread.currentThread().getName() + "取出元素：" + stringSynchronousQueue.take());
+            } catch (InterruptedException e) {
+                e.printStackTrace();
+            }
+        }).start();
+
+
+        new Thread(() -> {
+            stringSynchronousQueue.add("3");
+            System.out.println(Thread.currentThread().getName() + "加入数据 3");
+        }).start();
+
+
+    }
+
+
+}
diff --git a/src/main/java/com/chen/dataStructure/study/queen/UseQueue_ConcurrentLinkedQueue.java b/src/main/java/com/chen/dataStructure/study/queen/UseQueue_ConcurrentLinkedQueue.java
@@ -0,0 +1,35 @@
+package com.chen.dataStructure.study.queen;
+
+import java.util.concurrent.ConcurrentLinkedQueue;
+
+/**
+ * @author :  chen weijie
+ * @Date: 2019-08-14 23:03
+ */
+public class UseQueue_ConcurrentLinkedQueue {
+
+
+    public static void main(String[] args) {
+
+
+        /**
+         * Add()和offer()都是加入元素的方法（在ConcurrentLinkedQueue中，这两个方法投有任何区别）
+         * Poll()和peek()都是取头元素节点，区别在于前者会删除元素，后者不会。
+         */
+
+        ConcurrentLinkedQueue<Integer> queue = new ConcurrentLinkedQueue<>();
+        queue.add(1);
+        queue.add(2);
+        queue.add(3);
+        queue.add(4);
+        queue.offer(5);
+
+        System.out.println("从头部取出元素，并从队列里删除 >> " + queue.poll());
+        System.out.println("删除元素后的长度：" + queue.size());
+        System.out.println("peek去取元素：" + queue.peek());
+        System.out.println("peek后的queue的长度：" + queue.size());
+
+    }
+
+
+}
diff --git a/src/main/java/com/chen/dataStructure/study/queen/delayQueue/WangBa.java b/src/main/java/com/chen/dataStructure/study/queen/delayQueue/WangBa.java
@@ -0,0 +1,62 @@
+package com.chen.dataStructure.study.queen.delayQueue;
+
+import java.util.concurrent.DelayQueue;
+
+/**
+ * @author :  chen weijie
+ * @Date: 2019-08-15 00:04
+ */
+public class WangBa implements Runnable {
+
+    private DelayQueue<Wangmin> queue = new DelayQueue<>();
+
+    public boolean yinye = true;
+
+
+    public void shangji(String name, String id, int money) {
+        Wangmin man = new Wangmin(name, id, 1000 * money + System.currentTimeMillis());
+        System.out.println("网名" + man.getName() + " 身份证" + man.getId() + "交钱" + money + "块,开始上机...");
+        this.queue.add(man);
+    }
+
+
+    public void xiaji(Wangmin man) {
+        System.out.println("网名" + man.getName() + " 身份证" + man.getId() + "时间到下机...");
+    }
+
+
+    @Override
+    public void run() {
+
+        while (yinye) {
+
+            try {
+                Wangmin man = queue.take();
+                xiaji(man);
+            } catch (InterruptedException e) {
+                e.printStackTrace();
+            }
+
+        }
+    }
+
+
+    public static void main(String[] args) {
+
+
+        System.out.println("网吧开始营业。。。");
+
+        WangBa siyu = new WangBa();
+        Thread shangwang = new Thread(siyu);
+
+        shangwang.start();
+
+        siyu.shangji("路人甲", "123", 1);
+        siyu.shangji("路人乙", "234", 10);
+        siyu.shangji("路人丙", "345", 5);
+
+
+    }
+
+
+}
diff --git a/src/main/java/com/chen/dataStructure/study/queen/delayQueue/Wangmin.java b/src/main/java/com/chen/dataStructure/study/queen/delayQueue/Wangmin.java
@@ -0,0 +1,47 @@
+package com.chen.dataStructure.study.queen.delayQueue;
+
+import java.util.concurrent.Delayed;
+import java.util.concurrent.TimeUnit;
+
+/**
+ * @author :  chen weijie
+ * @Date: 2019-08-14 23:58
+ */
+public class Wangmin implements Delayed {
+
+
+    private String name;
+    //身份证
+    private String id;
+    //截止时间
+    private long endTime;
+    //定义时间工具类
+    private TimeUnit timeUnit = TimeUnit.SECONDS;
+
+    public Wangmin(String name, String id, long endTime) {
+        this.name = name;
+        this.id = id;
+        this.endTime = endTime;
+    }
+
+    public String getName() {
+        return this.name;
+    }
+
+    public String getId() {
+        return this.id;
+    }
+
+
+    @Override
+    public long getDelay(TimeUnit unit) {
+        return endTime - System.currentTimeMillis();
+    }
+
+    @Override
+    public int compareTo(Delayed o) {
+
+        Wangmin w = (Wangmin) o;
+        return this.getDelay(timeUnit) - w.getDelay(this.timeUnit) > 0 ? 1 : 0;
+    }
+}
diff --git a/src/main/java/com/chen/dataStructure/study/queen/priorityQueue/Task.java b/src/main/java/com/chen/dataStructure/study/queen/priorityQueue/Task.java
diff --git a/src/main/java/com/chen/dataStructure/study/queen/priorityQueue/UsePriorityBlockingQueue.java b/src/main/java/com/chen/dataStructure/study/queen/priorityQueue/UsePriorityBlockingQueue.java
diff --git a/src/main/java/com/chen/dataStructure/study/queen/quee.md b/src/main/java/com/chen/dataStructure/study/queen/quee.md
diff --git a/src/main/java/com/chen/dataStructure/study/set/HashSetTest.java b/src/main/java/com/chen/dataStructure/study/set/HashSetTest.java
diff --git a/src/main/java/com/chen/dataStructure/study/set/treeset/GeneralTreeSetTest.java b/src/main/java/com/chen/dataStructure/study/set/treeset/GeneralTreeSetTest.java
diff --git a/src/main/java/com/chen/dataStructure/study/set/treeset/TreeSetGeneralSortTest.java b/src/main/java/com/chen/dataStructure/study/set/treeset/TreeSetGeneralSortTest.java
diff --git a/src/main/java/com/chen/dataStructure/study/set/treeset/objectSort/TreeSetComparotor.java b/src/main/java/com/chen/dataStructure/study/set/treeset/objectSort/TreeSetComparotor.java
diff --git a/src/main/java/com/chen/dataStructure/study/set/treeset/objectSort/TreeSetObject.java b/src/main/java/com/chen/dataStructure/study/set/treeset/objectSort/TreeSetObject.java
diff --git a/src/main/java/com/chen/dataStructure/study/set/treeset/objectSort/TreeSetObjectSortTest.java b/src/main/java/com/chen/dataStructure/study/set/treeset/objectSort/TreeSetObjectSortTest.java
diff --git a/src/main/java/com/chen/dataStructure/study/test.java b/src/main/java/com/chen/dataStructure/study/test.java

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.chen.dataStructure.array;`
	`1`	`+package com.chen.dataStructure.self.array;`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* @author : chen weijie`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.chen.dataStructure.hash;`
	`1`	`+package com.chen.dataStructure.self.hash;`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* @author : chen weijie`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.chen.dataStructure.heap;`
	`1`	`+package com.chen.dataStructure.self.heap;`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* 堆`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.chen.dataStructure.linklistnode;`
	`1`	`+package com.chen.dataStructure.self.linklistnode;`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* 单链表的具体实现`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.chen.dataStructure.linknode;`
	`1`	`+package com.chen.dataStructure.self.linknode;`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* 双端队列`