1.添加数据结构

jossc · jossc · commit 5ed5803c45ae · 2019-12-16T10:01:32.000+08:00
diff --git a/src/main/java/com/basics/dynamicAgecy/CglibProxy.java b/src/main/java/com/basics/dynamicAgecy/CglibProxy.java
@@ -1,7 +1,6 @@
 package com.basics.dynamicAgecy;
 
 import com.basics.agency.PerformanceMonior;
-import net.sf.cglib.proxy.Callback;
 import net.sf.cglib.proxy.Enhancer;
 import net.sf.cglib.proxy.MethodInterceptor;
 import net.sf.cglib.proxy.MethodProxy;
@@ -24,11 +23,11 @@ public Object getProxy(Class clazz) {
         return enhancer.create();
     }
 
+    @Override
     public Object intercept(Object o, Method method, Object[] objects, MethodProxy methodProxy) throws Throwable {
         PerformanceMonior.begin(o.getClass().getName()+"."+method.getName());
         Object result = methodProxy.invokeSuper(o, objects);
         PerformanceMonior.end();
-
         Object proxyObject =  getProxy(this.getClass());
         return result;
     }
diff --git a/src/main/java/com/concurrent/cache/LhsPadding.java b/src/main/java/com/concurrent/cache/LhsPadding.java
@@ -0,0 +1,12 @@
+package com.concurrent.cache;
+
+/**
+ * @ClassName LhsPadding
+ * @Author chenzhuo
+ * @Version 1.0
+ * @Date 2019/12/9 7:51 下午
+ **/
+public class LhsPadding {
+
+    protected long p1, p2, p3, p4, p5, p6, p7;
+}
diff --git a/src/main/java/com/concurrent/cache/RhsPadding.java b/src/main/java/com/concurrent/cache/RhsPadding.java
@@ -0,0 +1,13 @@
+package com.concurrent.cache;
+
+/**
+ * @ClassName RhsPadding
+ * @Author chenzhuo
+ * @Version 1.0
+ * @Date 2019/12/9 7:52 下午
+ **/
+public class RhsPadding extends Value {
+
+    protected long p9, p10, p11, p12, p13, p14, p15;
+
+}
diff --git a/src/main/java/com/concurrent/cache/RunTask.java b/src/main/java/com/concurrent/cache/RunTask.java
@@ -0,0 +1,40 @@
+package com.concurrent.cache;
+
+import sun.util.resources.ga.LocaleNames_ga;
+
+import java.util.concurrent.RecursiveTask;
+
+/**
+ * @ClassName RunTask
+ * @Author chenzhuo
+ * @Version 1.0
+ * @Date 2019/12/9 9:08 下午
+ **/
+public class RunTask<T> extends RecursiveTask<T> {
+
+    private long start;
+
+    private long end;
+
+    private static final long THRESHOLD = 2;
+
+    public RunTask(long start, long end) {
+        this.start = start;
+        this.end = end;
+    }
+
+    @Override
+    protected T compute() {
+        long threshold = start - end;
+        Long sum = 0L;
+        if (threshold < THRESHOLD) {
+            for (long l = start; l < end; l++) {
+                sum = sum + 1;
+            }
+            return (T) sum;
+        }
+        return null;
+    }
+
+
+}
diff --git a/src/main/java/com/concurrent/cache/Value.java b/src/main/java/com/concurrent/cache/Value.java
@@ -0,0 +1,13 @@
+package com.concurrent.cache;
+
+/**
+ * @ClassName Value
+ * @Author chenzhuo
+ * @Version 1.0
+ * @Date 2019/12/9 7:51 下午
+ **/
+public class Value extends LhsPadding {
+
+    protected volatile long value;
+
+}
diff --git a/src/main/java/com/concurrent/thread/forkjoin/ForkJoinTest.java b/src/main/java/com/concurrent/thread/forkjoin/ForkJoinTest.java
@@ -0,0 +1,22 @@
+package com.concurrent.thread.forkjoin;
+
+import java.util.concurrent.ForkJoinPool;
+import java.util.concurrent.ForkJoinTask;
+
+/**
+ * @ClassName ForkJoinTest
+ * @Author chenzhuo
+ * @Version 1.0
+ * @Date 2019/12/9 7:28 下午
+ **/
+public class ForkJoinTest {
+
+    public static void main(String[] args) {
+        ForkJoinPool joinPool = new ForkJoinPool();
+        /*ForkJoinTask forkJoinTask =
+        joinPool.execute(forkJoinTask);
+        forkJoinTask.get();
+*/
+
+    }
+}
diff --git a/src/main/java/com/datastructure/package-info.java b/src/main/java/com/datastructure/package-info.java
@@ -2,13 +2,21 @@
  * @Description 数据结构相关
  * 1.线性结构
  *  a.数组
+ *
  *  b.arrayList
  *  c.linkList
+ *
  *  d.queue
  *      1.单向队列
  *      2.循环单向队列
  *      3.双向队列
  *      4.循环双想队列
+ *  e.stack 栈
+ *      {@link com.datastructure.stack.StackArray}
+ *      可以扩展的栈 {@link com.datastructure.stack.StackCapacityArray}
+ *
+ *
+ *
  *
  * @Date 2019/5/31 14:57
  * @author by chenzhuo
diff --git a/src/main/java/com/datastructure/queue/ArrayQueue.java b/src/main/java/com/datastructure/queue/ArrayQueue.java
@@ -0,0 +1,81 @@
+package com.datastructure.queue;
+
+/**
+ * 顺序队列
+ *
+ * @ClassName ArrayQueue
+ * @Author chenzhuo
+ * @Version 1.0
+ * @Date 2019/12/11 12:53 下午
+ **/
+public class ArrayQueue {
+
+    private String[] items;
+
+    private int n = 0;
+
+    /**
+     * 头部指针
+     */
+    private int head = 0;
+
+    /**
+     * 尾部指针
+     */
+    private int tail = 0;
+
+
+    public ArrayQueue(int n) {
+        this.n = n;
+        items = new String[n];
+    }
+
+    /**
+     * 入队列
+     *
+     * @param item
+     * @return
+     */
+    public boolean enqueue(String item) {
+        if (tail == n) {
+            return false;
+        }
+        items[tail] = item;
+        ++tail;
+        return true;
+    }
+
+    public boolean enqueueUpdate(String item) {
+        if (tail == n) {
+            if (head == 0) {
+                return false;
+            }
+            /**
+             * 进行数据前移
+             */
+            for (int i = head; i < tail; i++) {
+                items[i - head] = items[i];
+            }
+            tail -= head;
+            head = 0;
+        }
+
+        items[tail] = item;
+        ++tail;
+        return true;
+    }
+
+    /**
+     * 出队列
+     *
+     * @return
+     */
+    public String dequeue() {
+        if (head == tail) {
+            return null;
+        }
+        String ret = items[head];
+        ++head;
+        return ret;
+    }
+}
diff --git a/src/main/java/com/datastructure/queue/LinkQueue.java b/src/main/java/com/datastructure/queue/LinkQueue.java
@@ -0,0 +1,69 @@
+package com.datastructure.queue;
+
+/**
+ * 链表队列
+ *
+ * @ClassName LinkQueue
+ * @Author chenzhuo
+ * @Version 1.0
+ * @Date 2019/12/15 8:52 下午
+ **/
+public class LinkQueue<T> {
+
+    private Node<T> head = null;
+
+    private Node<T> tail = null;
+
+    public void enqueue(String value) {
+        if (tail == null) {
+            Node<T> newNode = new Node<T>(value, null);
+            head = newNode;
+            tail = newNode;
+        } else {
+            tail.next = new Node<T>(value, null);
+            tail = tail.next;
+        }
+    }
+
+    public String dequeue() {
+        if (head == null) {
+            return null;
+        }
+
+        String value = head.data;
+        head = head.next;
+        if (head == null) {
+            tail = null;
+        }
+        return value;
+    }
+
+
+    private static class Node<T> {
+
+        private String data;
+
+        private Node<T> next;
+
+        public Node(String data, Node<T> next) {
+            this.data = data;
+            this.next = next;
+        }
+
+        public String getData() {
+            return data;
+        }
+    }
+
+    public static void main(String[] args) {
+        LinkQueue<String> linkQueue =new LinkQueue<>();
+        linkQueue.enqueue("hhhh");
+        linkQueue.enqueue("hhhh1");
+        linkQueue.enqueue("hhhh2");
+        linkQueue.enqueue("hhhh3");
+        linkQueue.dequeue();
+    }
+
+}
+
+
diff --git a/src/main/java/com/datastructure/stack/BrowserStack.java b/src/main/java/com/datastructure/stack/BrowserStack.java
@@ -0,0 +1,52 @@
+package com.datastructure.stack;
+
+/**
+ * 用栈实现浏览器 前进后退功能
+ *
+ * @ClassName BrowserStack
+ * @Author chenzhuo
+ * @Version 1.0
+ * @Date 2019/12/9 12:56 下午
+ **/
+public class BrowserStack {
+
+    public static void main(String[] args) {
+/*
+        StackCapacityArray<String> old = new StackCapacityArray<String>();
+
+        StackCapacityArray<String> newStack = new StackCapacityArray<String>();*/
+    }
+
+
+    /**
+     * 上一步
+     * 根据index判断是否由上一步
+     * 如果有上一步就返回上一步的index
+     * 如果没有就返回当前index
+     *
+     * @param index 索引标记
+     */
+    public String nextValue(int index, StackCapacityArray<String> old, StackCapacityArray<String> newStack) {
+        if (index < 0) {
+            throw new RuntimeException("index must greater than 0");
+        }
+        String nextValue = old.get(index - 1);
+        newStack.addElement(nextValue);
+        return nextValue;
+    }
+
+
+    /**
+     * 下一步
+     * 根据index 判断是否有下一步
+     * 如果有下一步就返回下一步，
+     * 如果没有就返回当前index
+     *
+     * @param index
+     */
+    public void pre(int index, StackCapacityArray<String> old, StackCapacityArray<String> newStack) {
+        if (index < 0) {
+            throw new RuntimeException("index must greater than 0");
+        }
+    }
+}
