From d018a3fa632949bfe2d60038e7a1d0c6488fc0ff Mon Sep 17 00:00:00 2001
From: orajavac <oraclegit@126.com>
Date: Tue, 28 Mar 2017 17:04:46 +0800
Subject: [PATCH] =?UTF-8?q?20170328=5F1702=203.26=E4=BD=9C=E4=B8=9A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../basic/linklist/LRUPageFrame.java          | 133 ++++++++
 .../basic/linklist/LRUPageFrameTest.java      |  29 ++
 .../coding2017/basic/linklist/LinkedList.java | 290 ++++++++++++++++++
 .../jvm/loader/ClassFileLoader.java           |  51 +++
 .../jvm/test/ClassFileloaderTest.java         |  85 +++++
 .../coding2017/jvm/test/EmployeeV1.java       |  26 ++
 6 files changed, 614 insertions(+)
 create mode 100644 group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LRUPageFrame.java
 create mode 100644 group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LRUPageFrameTest.java
 create mode 100644 group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LinkedList.java
 create mode 100644 group02/562768642/src/com/github/orajavac/coding2017/jvm/loader/ClassFileLoader.java
 create mode 100644 group02/562768642/src/com/github/orajavac/coding2017/jvm/test/ClassFileloaderTest.java
 create mode 100644 group02/562768642/src/com/github/orajavac/coding2017/jvm/test/EmployeeV1.java

diff --git a/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LRUPageFrame.java b/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LRUPageFrame.java
new file mode 100644
index 0000000000..3240f2558c
--- /dev/null
+++ b/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LRUPageFrame.java
@@ -0,0 +1,133 @@
+package com.github.orajavac.coding2017.basic.linklist;
+
+public class LRUPageFrame {
+private static class Node {
+		
+		Node prev;
+		Node next;
+		int pageNum=10000;
+		String flag;
+
+		Node() {
+		}
+	}
+
+	private int capacity;
+	private int length;
+	
+	
+	private Node first;// 链表头
+	private Node last;// 链表尾
+
+	
+	public LRUPageFrame(int capacity) {
+		
+		this.capacity = capacity;
+		
+		first = new Node();
+		last = new Node();
+		last.flag = "last";		//用来标识最后一个节点是链表尾，在这里链表尾并不算做内存页
+		first.flag = "first";	//用来标识链表头，在这里链表头并不算做内存页
+		first.next = last;
+		last.prev=first;
+	}
+
+	/**
+	 * 获取缓存中对象
+	 * 
+	 * @param key
+	 * @return
+	 */
+	public void access(int pageNum) {
+		if(lookup(pageNum)){
+			;
+		}else{
+			if (length<capacity){
+				addFirst(pageNum);
+			}else{
+				remove(pageNum);	//删除尾元素
+				addFirst(pageNum);
+			}
+		}
+	}
+	
+	public boolean lookup(int pageNum){
+		Node nodef = first;
+		Node nodel = last;
+		
+		//判断要找的元素是否在第一个节点里
+		if (nodef.next.pageNum == pageNum){
+			return true;
+		}
+		
+		//判断要找的元素是否在最后一个节点里
+		if (nodel.prev.pageNum == pageNum){
+			remove(pageNum);	//删除尾元素
+			addFirst(pageNum);	//把访问pageNum添加到第一个节点里
+			return true;
+		}
+		
+		while(nodef.next!=null&&nodef.next.pageNum != 999){
+			if (nodef.next.pageNum == pageNum){
+				nodef.next = nodef.next.next;	//先删除元素
+				nodef.next.prev = nodef;
+				addFirst(pageNum);	//再把访问添加元素
+				return true;
+			}
+			nodef = nodef.next;
+		}
+		return false;
+	}
+	
+	public void remove(int pageNum){
+		length--;
+		Node n = last.prev;
+		last.prev = n.prev;
+		n.prev.next = last;
+	}
+	
+	public void addFirst(int pageNum){
+		Node s = first.next;
+		Node n = new Node();
+		n.pageNum=pageNum;
+		n.next=s;
+		s.prev=n;
+		first.next=n;
+		length++;
+	}
+
+	public String toString(){
+		StringBuilder buffer = new StringBuilder();
+		Node node = first;
+		while(node.next.flag != "last"){
+			buffer.append(node.next.pageNum);			
+			
+			node = node.next;
+			
+			if(node.next.flag != "last"){
+				buffer.append(",");
+			}
+			
+		}
+		return buffer.toString();
+	}
+	
+	/**
+	 * 测试双向链表逆序输出
+	 * @return
+	 */
+	public String lastToString(){
+		StringBuilder buffer = new StringBuilder();
+		Node node = last;
+		while(node.prev!=null&&node.prev.flag != "first"){
+			buffer.append(node.prev.pageNum);			
+			
+			node = node.prev;
+			
+			if(node.prev!=null&&node.prev.flag != "first"){
+				buffer.append(",");
+			}
+		}
+		return buffer.toString();
+	}
+}
diff --git a/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LRUPageFrameTest.java b/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LRUPageFrameTest.java
new file mode 100644
index 0000000000..f511745d7a
--- /dev/null
+++ b/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LRUPageFrameTest.java
@@ -0,0 +1,29 @@
+package com.github.orajavac.coding2017.basic.linklist;
+
+import org.junit.Test;
+
+import junit.framework.Assert;
+
+public class LRUPageFrameTest {
+	
+	@Test
+	public void testAccess() {
+		LRUPageFrame frame = new LRUPageFrame(3);
+		frame.access(7);
+		frame.access(0);
+		frame.access(1);
+		Assert.assertEquals("1,0,7", frame.toString());
+		frame.access(2);
+		Assert.assertEquals("2,1,0", frame.toString());
+		frame.access(0);
+		Assert.assertEquals("0,2,1", frame.toString());
+		frame.access(0);
+		Assert.assertEquals("0,2,1", frame.toString());
+		frame.access(3);
+		Assert.assertEquals("3,0,2", frame.toString());
+		frame.access(0);
+		Assert.assertEquals("0,3,2", frame.toString());
+		frame.access(4);
+		Assert.assertEquals("4,0,3", frame.toString());
+	}
+}
diff --git a/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LinkedList.java b/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LinkedList.java
new file mode 100644
index 0000000000..4d07d4eb30
--- /dev/null
+++ b/group02/562768642/src/com/github/orajavac/coding2017/basic/linklist/LinkedList.java
@@ -0,0 +1,290 @@
+package com.github.orajavac.coding2017.basic.linklist;
+
+import com.github.orajavac.coding2017.basic.Iterator;
+import com.github.orajavac.coding2017.basic.List;
+
+public class LinkedList implements List,Iterator {
+	
+	public Node head;
+	
+	private int size=0;
+	
+	private static class Node{
+		Object data;
+		Node next;	
+	}
+	
+	public Iterator iterator(){
+		return null;
+	}
+	
+	public boolean hasNext(){
+		return false;
+	}
+	
+	public Object next(){
+		return null;
+	}
+	
+	public void add(Object o){
+		if (head == null){
+			head = new Node();
+			Node n = new Node();
+			n.data = o;
+			head.next = n;
+			size++;
+			head.data=size;
+		}else{
+			Node e = head.next;
+			while (e.next!=null){
+				e=e.next;
+			}
+			Node n = new Node();
+			n.data = o;
+			e.next=n;
+			size++;
+			head.data=size;
+		}
+	}
+	
+	public Object get(int index){
+		int len=Integer.parseInt(head.data.toString());
+		if (index>len||index<=0){
+			throw new RuntimeException("下标不存在"+index);
+		}
+		Node e = head;
+		int i=0;
+		while (e.next != null){
+			i++;
+			if (i == index){
+				return e.next.data;
+			}
+			e=e.next;
+		}
+		return null;
+	}
+	
+	public Object remove(int index){
+		int len=Integer.parseInt(head.data.toString());
+		if (index>len||index<=0){
+			throw new RuntimeException("下标不存在"+index);
+		}
+		Node e = head;
+		Object data = null;
+		int i=0;
+		while (e.next != null){
+			i++;
+			if (i == index){
+				len--;
+				head.data = len;
+				data = e.next.data;
+				e.next = e.next.next;
+				return data;
+			}
+			e=e.next;
+		}
+		return null;
+	}
+	
+	public Object removeFirst(){
+		return remove(1);
+	}
+	
+	public Object removeLast(){
+		return remove(Integer.parseInt(head.data.toString()));
+	}
+	
+	public void addFirst(Object o){
+		Node e = head.next;
+		Node n = new Node();
+		n.data=o;
+		n.next=e;
+		size++;
+		head.next=n;
+		head.data=size;
+	}
+	
+	public void addLast(Object o){
+		add(o);
+	}
+	
+	public int size(){
+		return Integer.parseInt(head.data.toString());
+	}
+	
+	public void listNode(){
+		Node n = head;
+		StringBuffer buffer = new StringBuffer();
+		while (n.next!=null){
+			buffer.append(n.next.data + " -> ");
+			n=n.next;
+		}
+		if(buffer.length()>0){
+			System.out.print(buffer.substring(0,buffer.length()-3));
+			System.out.println();
+		}
+	}
+	
+	/**
+	 * 把该链表逆置
+	 * 例如链表为 3->7->10 , 逆置后变为  10->7->3
+	 */
+	public void reverse(){		
+		
+	}
+	
+	/**
+	 * 从第i个元素开始， 删除length 个元素 ， 注意i从0开始
+	 * @param i
+	 * @param length
+	 */
+	public void remove(int i, int length){
+		if (i <= 0 || length<=0){
+			throw new RuntimeException("起始值、结束值都不能小于0等于");
+		}
+		int len = length + i;
+		if (len > size){
+			throw new RuntimeException("删除索引长度超过了链表长度");
+		}
+		Node e = head;
+		int y = 0;
+		while (e.next != null){
+			y++;
+			if (y == i){
+				Node n = e.next;
+				while (n!=null){
+					n = n.next;
+					if (y == length){
+						break;
+					}
+					y++;
+					n=n.next;
+				}
+			}
+			e=e.next;
+		}
+	}
+	
+	/**
+	 * 假定当前链表和list均包含已升序排列的整数
+	 * 从当前链表中取出那些list所指定的元素
+	 * 例如当前链表 = 11->101->201->301->401->501->601->701
+	 * listB = 1->3->4->6
+	 * 返回的结果应该是[101,301,401,601]  
+	 * @param list
+	 */
+	public int[] getElements(LinkedList list){
+		if (list==null||list.head==null){
+			throw new RuntimeException("集合没有初始化");
+		}
+		int[] elements = new int[Integer.parseInt(list.head.data.toString())];
+		Node l = list.head;
+		Node n = head;
+		int len = 0;
+		int i = 0;
+		while (l.next!=null){
+			len = 0;
+			n=head;
+			while(n.next!=null){
+				len++;
+				if(len==Integer.parseInt(l.next.data.toString())){
+					elements[i]=Integer.parseInt(n.next.data.toString());
+					i++;
+					break;
+				}
+				n=n.next;
+			}
+			l = l.next;
+		}
+		return elements;
+	}
+	
+	/**
+	 * 删除一个单链表的前半部分
+	 * 例如：list = 2->5->7->8 , 删除以后的值为 7->8
+	 * 如果list = 2->5->7->8->10 ,删除以后的值为7,8,10
+
+	 */
+	public  void removeFirstHalf(){
+		
+	}
+	
+	/**
+	 * 已知链表中的元素以值递增有序排列，并以单链表作存储结构。
+	 * 从当前链表中中删除在list中出现的元素 
+
+	 * @param list
+	 */
+	
+	public void subtract(LinkedList list){
+		if (list==null||list.head==null){
+			throw new RuntimeException("集合没有初始化");
+		}
+		Node l = list.head;
+		Node n = head;
+		int i = 0;
+		while (l.next!=null){
+			n=head;
+			i=0;
+			while(n.next!=null){
+				i++;
+				if(n.next.data.equals(l.next.data)){
+					remove(i);
+					break;
+				}
+				n=n.next;
+			}
+			l = l.next;
+		}
+	}
+	
+	/**
+	 * 已知当前链表中的元素以值递增有序排列，并以单链表作存储结构。
+	 * 删除表中所有值相同的多余元素（使得操作后的线性表中所有元素的值均不相同）
+	 */
+	public void removeDuplicateValues(){
+		
+	}
+	
+	/**
+	 * 已知链表中的元素以值递增有序排列，并以单链表作存储结构。
+	 * 试写一高效的算法，删除表中所有值大于min且小于max的元素（若表中存在这样的元素）
+	 * 11->101->201->301->401->501->601->701
+	 * @param min
+	 * @param max
+	 */
+	public void removeRange(int min, int max){
+		if (min<=0||max<=0||min>max){
+			throw new RuntimeException("录入不正确："+min+","+max+" 应该大于min且小于max的元素");
+		}
+		Node n = head;
+		int data = 0;
+		Node p = null;
+		while(n.next != null){
+			data=Integer.parseInt(n.next.data.toString());	//11
+			if(data>min&&data<max){
+				p = n.next.next;	//101
+				n.next = p;
+				size--;
+			}else{
+				n = n.next;
+			}
+		}
+		head.data=size;
+	}
+	
+	/**
+	 * 假设当前链表和参数list指定的链表均以元素依值递增有序排列（同一表中的元素值各不相同）
+	 * 现要求生成新链表C，其元素为当前链表和list中元素的交集，且表C中的元素有依值递增有序排列
+	 * @param list
+	 */
+	public  LinkedList intersection( LinkedList list){
+		return null; 
+	}
+
+	public void add(int index, Object o) {
+		// TODO Auto-generated method stub
+		
+	}
+	
+}
diff --git a/group02/562768642/src/com/github/orajavac/coding2017/jvm/loader/ClassFileLoader.java b/group02/562768642/src/com/github/orajavac/coding2017/jvm/loader/ClassFileLoader.java
new file mode 100644
index 0000000000..062df44717
--- /dev/null
+++ b/group02/562768642/src/com/github/orajavac/coding2017/jvm/loader/ClassFileLoader.java
@@ -0,0 +1,51 @@
+package com.github.orajavac.coding2017.jvm.loader;
+
+import java.io.BufferedInputStream;
+import java.io.ByteArrayOutputStream;
+import java.io.File;
+import java.io.FileInputStream;
+import java.util.ArrayList;
+import java.util.List;
+
+public class ClassFileLoader {
+	
+	private List<String> clzPaths = new ArrayList<String>();
+	
+	public byte[] readBinaryCode(String className) {
+		byte[] b = null;
+		try{
+			File clfile = new File(packageToPath(className));
+			@SuppressWarnings("resource")
+			BufferedInputStream in = new BufferedInputStream(new FileInputStream(clfile));
+			ByteArrayOutputStream out = new ByteArrayOutputStream(1024);
+			byte[] buffer = new byte[1024];
+			int size = 0;         
+	        while ((size = in.read(buffer)) != -1) {         
+	            out.write(buffer, 0, size);         
+	        }
+	        b = out.toByteArray();
+		}catch(Exception e){
+			e.printStackTrace();
+		}
+		return b;		
+	}
+	
+	
+	public void addClassPath(String path) {
+		clzPaths.add(path);
+	}
+	
+	
+	
+	public String getClassPath(){
+		StringBuffer buffer = new StringBuffer();
+		for (int i=0;i<clzPaths.size();i++){
+			buffer.append(clzPaths.get(i)).append(";");
+		}
+		return buffer.toString().substring(0,buffer.length()-1);
+	}
+	
+	public String packageToPath(String className){
+		return clzPaths.get(0)+className.replace(".", "/")+".class";
+	}
+}
diff --git a/group02/562768642/src/com/github/orajavac/coding2017/jvm/test/ClassFileloaderTest.java b/group02/562768642/src/com/github/orajavac/coding2017/jvm/test/ClassFileloaderTest.java
new file mode 100644
index 0000000000..d0fccac28f
--- /dev/null
+++ b/group02/562768642/src/com/github/orajavac/coding2017/jvm/test/ClassFileloaderTest.java
@@ -0,0 +1,85 @@
+package com.github.orajavac.coding2017.jvm.test;
+
+import org.junit.After;
+import org.junit.Assert;
+import org.junit.Before;
+import org.junit.Test;
+
+import com.github.orajavac.coding2017.jvm.loader.ClassFileLoader;
+
+public class ClassFileloaderTest {
+	static String path1 = "bin/";
+	static String path2 = "com/github/orajavac/coding2017/jvm/EmployeeV1";
+	
+	
+	
+	@Before
+	public void setUp() throws Exception {		 
+	}
+
+	@After
+	public void tearDown() throws Exception {
+	}
+	
+	@Test
+	public void testClassPath(){		
+		
+		ClassFileLoader loader = new ClassFileLoader();
+		loader.addClassPath(path1);
+		loader.addClassPath(path2);
+		
+		String clzPath = loader.getClassPath();
+		
+		Assert.assertEquals(path1+";"+path2,clzPath);
+		
+	}
+	
+	@Test
+	public void testClassFileLength() {		
+		
+		ClassFileLoader loader = new ClassFileLoader();
+		loader.addClassPath(path1);
+		
+		String className = "com.github.orajavac.coding2017.jvm.EmployeeV1";
+		
+		byte[] byteCodes = loader.readBinaryCode(className);
+		
+		// 注意：这个字节数可能和你的JVM版本有关系， 你可以看看编译好的类到底有多大
+		Assert.assertEquals(1078, byteCodes.length);
+		
+	}
+	
+	
+    @Test	
+	public void testMagicNumber(){
+    	ClassFileLoader loader = new ClassFileLoader();
+		loader.addClassPath(path1);
+		String className = "com.github.orajavac.coding2017.jvm.EmployeeV1";
+		byte[] byteCodes = loader.readBinaryCode(className);
+		byte[] codes = new byte[]{byteCodes[0],byteCodes[1],byteCodes[2],byteCodes[3]};
+		
+		
+		String acctualValue = this.byteToHexString(codes);
+		
+		Assert.assertEquals("cafebabe", acctualValue);
+	}
+    
+    
+    
+    
+    
+    
+	private String byteToHexString(byte[] codes ){
+		StringBuffer buffer = new StringBuffer();
+		for(int i=0;i<codes.length;i++){
+			byte b = codes[i];
+			int value = b & 0xFF;
+			String strHex = Integer.toHexString(value);
+			if(strHex.length()< 2){
+				strHex = "0" + strHex;
+			}		
+			buffer.append(strHex);
+		}
+		return buffer.toString();
+	}
+}
diff --git a/group02/562768642/src/com/github/orajavac/coding2017/jvm/test/EmployeeV1.java b/group02/562768642/src/com/github/orajavac/coding2017/jvm/test/EmployeeV1.java
new file mode 100644
index 0000000000..81d0ba0e20
--- /dev/null
+++ b/group02/562768642/src/com/github/orajavac/coding2017/jvm/test/EmployeeV1.java
@@ -0,0 +1,26 @@
+package com.github.orajavac.coding2017.jvm.test;
+
+public class EmployeeV1 {
+	private String name;
+    private int age;
+    
+    public EmployeeV1(String name, int age) {
+        this.name = name;
+        this.age = age;        
+    }    
+
+    public void setName(String name) {
+        this.name = name;
+    }
+    public void setAge(int age){
+    	this.age = age;
+    }
+    public void sayHello() {        
+    	System.out.println("Hello , this is class Employee ");    	
+    }
+    public static void main(String[] args){
+    	EmployeeV1 p = new EmployeeV1("Andy",29);
+    	p.sayHello();    
+    	
+    }
+}