Merge pull request #13 from lazub/testpr

test

group03/2864885311/DS/.classpath

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" path="src"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.junit.JUNIT_CONTAINER/4"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

group03/2864885311/DS/.gitignore

@@ -0,0 +1 @@
+/bin/

group03/2864885311/DS/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>2017Learning</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

group03/2864885311/DS/.settings/org.eclipse.jdt.core.prefs

@@ -0,0 +1,11 @@
+eclipse.preferences.version=1
+org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
+org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
+org.eclipse.jdt.core.compiler.compliance=1.8
+org.eclipse.jdt.core.compiler.debug.lineNumber=generate
+org.eclipse.jdt.core.compiler.debug.localVariable=generate
+org.eclipse.jdt.core.compiler.debug.sourceFile=generate
+org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
+org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
+org.eclipse.jdt.core.compiler.source=1.8

group03/2864885311/DS/src/com/coding/basic/ArrayList.java

@@ -0,0 +1,68 @@
+package com.coding.basic;
+//import java.util.Iterator;
+
+//import java.util.List;
+
+public class ArrayList implements List {
+
+	private int size = 0;
+
+	private Object[] elementData = new Object[100];
+
+	public void add(Object o){
+		//int int_inarry = 10;
+		grow(o);
+
+	}
+	public void add(int index, Object o){
+
+
+
+
+	}
+
+	public Object get(int index){
+		return null;
+	}
+
+	public Object remove(int index){
+		return null;
+	}
+
+	public int size(){
+		return -1;
+	}
+
+	public Iterator iterator(){
+		return null;
+	}
+
+	private void grow(Object nbradd){
+
+		if (this.size>this.elementData.length){
+			Object[] arrayRefVar = new Object[this.elementData.length+1];
+			growcopy(nbradd,arrayRefVar);
+		}else{
+			Object[] arrayRefVar = new Object[this.elementData.length];
+			growcopy(nbradd,arrayRefVar);
+		}
+	}
+	private void growcopy(Object nbraddcopy,Object[] arrayRefVarcopy){
+		System.arraycopy(this.elementData, 0, arrayRefVarcopy, 0, this.elementData.length);
+		this.elementData[0]=nbraddcopy;
+		System.arraycopy(arrayRefVarcopy, 0, this.elementData, 1, this.size+1);
+		this.size++;			
+	}
+	private void instrgrow(int nbrindex,Object[] arraynbo,Object ino){
+
+		//Object[] arrayRefVar2 = new Object[nbrindex];
+		Object[] arrayRefVar3 = new Object[this.size-nbrindex];
+
+
+		System.arraycopy(this.elementData, nbrindex, arrayRefVar3, nbrindex, this.size);
+		this.elementData[nbrindex]=ino;
+		System.arraycopy(arrayRefVar3, 0, this.elementData, nbrindex+1, this.size);
+
+
+	}
+}

group03/2864885311/DS/src/com/coding/basic/BinaryTreeNode.java

@@ -0,0 +1,32 @@
+package com.coding.basic;
+
+public class BinaryTreeNode {
+
+	private Object data;
+	private BinaryTreeNode left;
+	private BinaryTreeNode right;
+
+	public Object getData() {
+		return data;
+	}
+	public void setData(Object data) {
+		this.data = data;
+	}
+	public BinaryTreeNode getLeft() {
+		return left;
+	}
+	public void setLeft(BinaryTreeNode left) {
+		this.left = left;
+	}
+	public BinaryTreeNode getRight() {
+		return right;
+	}
+	public void setRight(BinaryTreeNode right) {
+		this.right = right;
+	}
+
+	public BinaryTreeNode insert(Object o){
+		return  null;
+	}
+
+}

group03/2864885311/DS/src/com/coding/basic/Iterator.java

@@ -0,0 +1,7 @@
+package com.coding.basic;
+
+public interface Iterator {
+	public boolean hasNext();
+	public Object next();
+
+}

group03/2864885311/DS/src/com/coding/basic/LinkedList.java

@@ -0,0 +1,46 @@
+package com.coding.basic;
+
+public class LinkedList implements List {
+
+	private Node head;
+
+	public void add(Object o){
+
+	}
+	public void add(int index , Object o){
+
+	}
+	public Object get(int index){
+		return null;
+	}
+	public Object remove(int index){
+		return null;
+	}
+
+	public int size(){
+		return -1;
+	}
+
+	public void addFirst(Object o){
+
+	}
+	public void addLast(Object o){
+
+	}
+	public Object removeFirst(){
+		return null;
+	}
+	public Object removeLast(){
+		return null;
+	}
+	public Iterator iterator(){
+		return null;
+	}
+
+
+	private static  class Node{
+		Object data;
+		Node next;
+
+	}
+}

group03/2864885311/DS/src/com/coding/basic/List.java

@@ -0,0 +1,10 @@
+package com.coding.basic;
+
+public interface List {
+
+	public void add(Object o);
+	public void add(int index, Object o);
+	public Object get(int index);
+	public Object remove(int index);
+	public int size();
+}

group03/2864885311/DS/src/com/coding/basic/Queue.java

@@ -0,0 +1,19 @@
+package com.coding.basic;
+
+public class Queue {
+
+	public void enQueue(Object o){		
+	}
+
+	public Object deQueue(){
+		return null;
+	}
+
+	public boolean isEmpty(){
+		return false;
+	}
+
+	public int size(){
+		return -1;
+	}
+}

group03/2864885311/DS/src/com/coding/basic/Stack.java

@@ -0,0 +1,22 @@
+package com.coding.basic;
+
+public class Stack {
+	private ArrayList elementData = new ArrayList();
+
+	public void push(Object o){		
+	}
+
+	public Object pop(){
+		return null;
+	}
+
+	public Object peek(){
+		return null;
+	}
+	public boolean isEmpty(){
+		return false;
+	}
+	public int size(){
+		return -1;
+	}
+}