update clang

Author: nange

README.md

@@ -4,9 +4,9 @@
 
 所有代码都经过具体测试运行，具体环境为：
 - 操作系统：ubuntu14.04 64位
-- Go语言版本： Go 1.3.1
+- Go语言版本： Go 1.4
 - Javascript执行环境： Nodejs 0.11.14
-- Java版本： Java 1.7.0_65
+- Java版本： Java 1.8.0_25
 - C语言编译器： gcc 4.8.2
 
 
@@ -20,7 +20,9 @@
 
 
 ### 列表
-列表是非常常见的一种数据结构，比如日常所见的购物清单、待办事项等等。它提供了对列表数据的一系列操作，比如：添加、删除、修改、遍历等功能。当我们把这样的具体问题抽象成用列表去解决的时候，往往可以简化问题。
+列表是非常常见的一种数据结构，比如日常所见的购物清单、待办事项等等。
+它提供了对列表数据的一系列操作，比如：添加、删除、修改、遍历等功能。
+当我们把这样的具体问题抽象成用列表去解决的时候，往往可以简化问题。
 
 具体实现： [Go]() 、 [Javascript]() 、 [Java]() 、 [C]()
 

c/arraylist/arraylist.c

@@ -20,6 +20,10 @@ ArrayList *listCreate() {
 	list->get = listGet;
 	list->set = listSet;
 	list->append = listAppend;
+	list->insert = listInsert;
+	list->remove = listRemove;
+	list->clear = listClear;
+	list->destory = listDestory;
 
 	return list;
 }
@@ -52,8 +56,34 @@ void listAppend(ArrayList *list, void *value) {
 	list->dataStore[list->theSize++] = value;
 }
 
+void listInsert(ArrayList *list, unsigned int index, void *value) {
+	assert(index < list->theSize);
+	listIsRealloc(list);
+	
+	memmove(list->dataStore+index+1, list->dataStore+index, 
+		sizeof(void *) * (list->theSize-index));
+	
+	list->dataStore[index] = value;
+	list->theSize++;
+}
 
+void listRemove(ArrayList *list, unsigned int index) {
+	assert(index < list->theSize);
+	memmove(list->dataStore+index, list->dataStore+index+1, 
+		sizeof(void *) * (list->theSize-index-1));
+	
+	list->theSize--;
+}
 
+void listClear(ArrayList *list) {
+	free(list->dataStore);
+	list->dataStore = malloc(sizeof(void *) * ARRAYLIST_DEAUFALT_SIZE);
+	assert(list->dataStore);
+	list->theSize = 0;
+	list->capacity = ARRAYLIST_DEAUFALT_SIZE;
+}
 
-
-
+void listDestory(ArrayList *list) {
+	free(list->dataStore);
+	free(list);
+}

c/arraylist/arraylist.h

@@ -10,9 +10,10 @@ typedef struct ArrayList {
 	void *(*get)(struct ArrayList *, unsigned int);
 	void (*set)(struct ArrayList *, unsigned int, void *);
 	void (*append)(struct ArrayList *, void *);
-	//void (*insertAfter)(ArrayList *, unsigned int, void *);
-	//void (*remove)(ArrayList *, unsigned int);
-	//void (*clear)(ArrayList *);
+	void (*insert)(struct ArrayList *, unsigned int, void *);
+	void (*remove)(struct ArrayList *, unsigned int);
+	void (*clear)(struct ArrayList *);
+	void (*destory)(struct ArrayList *);
 } ArrayList;
 
 /* Prototypes */
@@ -21,8 +22,9 @@ int listSize(ArrayList *list);
 void *listGet(ArrayList *list, unsigned int index);
 void listSet(ArrayList *list, unsigned int index, void *value);
 void listAppend(ArrayList *list, void *value);
-void listInsertAfter(ArrayList *list, unsigned int index, void *value);
+void listInsert(ArrayList *list, unsigned int index, void *value);
 void listRemove(ArrayList *list, unsigned int index);
 void listClear(ArrayList *list);
+void listDestory(ArrayList *list);
 
 #endif	/* __ARRAYLIST_H__ */

c/arraylist/arraylist_test.c

@@ -3,6 +3,8 @@
 #include "arraylist.c"
 
 int main() {
+	printf("\nRunning arraylist.c tests.\n\n");
+	
 	ArrayList *list = listCreate();
 	assert(list->size(list) == 0);
 
@@ -27,7 +29,42 @@ int main() {
 	int item2_new = *(int *)list->get(list, 1);
 	assert(item2_new == 2);
 
-	printf("\n ArrayList test pass...\n\n");
+	list->destory(list);
+	list = NULL;
+	assert(!list);
+	
+	int a1 = 1;
+	int a2 = 2;
+	int a3 = 3;
+	int a4 = 4;
+	ArrayList *list2 = listCreate();
+	list2->append(list2, &a1);
+	list2->append(list2, &a2);
+	list2->append(list2, &a3);
+	list2->insert(list2, 2, &a4);
+	assert(list2->size(list2) == 4);
+	
+	int r1 = *(int *)list2->get(list2, 0);
+	int r2 = *(int *)list2->get(list2, 1);
+	int r3 = *(int *)list2->get(list2, 2);
+	int r4 = *(int *)list2->get(list2, 3);
+	assert(r1 == 1);
+	assert(r2 == 2);
+	assert(r3 == 4);
+	assert(r4 == 3);
+	
+	list2->remove(list2, 0);
+	r1 = *(int *)list2->get(list2, 0);
+	assert(r1 == 2);
+	assert(list2->size(list2) == 3);
+	
+	list2->clear(list2);
+	assert(list2->size(list2) == 0);
+	
+	list2->destory(list2);
+	list2 = NULL;
+	assert(!list2);
+	
+	printf("All arraylist.c tests completed.\n\n");
 	return 0;
 }
-

java/arraylist/MyArrayList.java

@@ -6,7 +6,7 @@
 public class MyArrayList<AnyType> {
 	private static final int DEFAULT_CAPACITY = 10;
 
-    private int size;
+	private int size;
     private AnyType[] items;
 
     public MyArrayList() {