Rename all identifiers with 2 underscores at the beginning

htfy96 · htfy96 · commit 21121a568710 · 2016-09-01T14:16:08.000+08:00
diff --git a/include/binary_search_tree.h b/include/binary_search_tree.h
@@ -57,7 +57,7 @@ namespace alg {
 				BST():m_root(NULL){};
 
 				~BST() {
-					__destruct(m_root);
+					destruct_(m_root);
 				}
 
 				/**
@@ -159,10 +159,10 @@ namespace alg {
 				}
 
 			private:
-				void __destruct(treeNode *n) {
+				void destruct_(treeNode *n) {
 					if (n==NULL) return;
-					__destruct(n->left);
-					__destruct(n->right);
+					destruct_(n->left);
+					destruct_(n->right);
 					delete n;
 				}
 
diff --git a/include/double_linked_list.h b/include/double_linked_list.h
@@ -39,7 +39,7 @@ struct list_head {
  * the prev/next entries already!
  */
 static inline void 
-__list_add(struct list_head *n,
+list_add_(struct list_head *n,
 			      struct list_head *prev,
 			      struct list_head *next)
 {
@@ -57,14 +57,14 @@ __list_add(struct list_head *n,
  * the prev/next entries already!
  */
 static inline void 
-__list_del(struct list_head *prev, struct list_head *next)
+list_del_(struct list_head *prev, struct list_head *next)
 {
 	next->prev = prev;
 	prev->next = next;
 }
 
 static inline void 
-__list_splice(struct list_head *list, struct list_head *head)
+list_splice_(struct list_head *list, struct list_head *head)
 {
 	struct list_head *first = list->next;
 	struct list_head *last = list->prev;
@@ -88,7 +88,7 @@ __list_splice(struct list_head *list, struct list_head *head)
 static inline void 
 list_add(struct list_head *n, struct list_head *head)
 {
-	__list_add(n, head, head->next);
+	list_add_(n, head, head->next);
 }
 
 /**
@@ -102,7 +102,7 @@ list_add(struct list_head *n, struct list_head *head)
 static inline void 
 list_add_tail(struct list_head *n, struct list_head *head)
 {
-	__list_add(n, head->prev, head);
+	list_add_(n, head->prev, head);
 }
 
 /**
@@ -113,7 +113,7 @@ list_add_tail(struct list_head *n, struct list_head *head)
 static inline void 
 list_del(struct list_head *entry)
 {
-	__list_del(entry->prev, entry->next);
+	list_del_(entry->prev, entry->next);
 	entry->next = NULL;
 	entry->prev = NULL;
 }
@@ -125,7 +125,7 @@ list_del(struct list_head *entry)
 static inline void 
 list_del_init(struct list_head *entry)
 {
-	__list_del(entry->prev, entry->next);
+	list_del_(entry->prev, entry->next);
 	INIT_LIST_HEAD(entry); 
 }
 
@@ -137,7 +137,7 @@ list_del_init(struct list_head *entry)
 static inline void 
 list_move(struct list_head *list, struct list_head *head)
 {
-        __list_del(list->prev, list->next);
+        list_del_(list->prev, list->next);
         list_add(list, head);
 }
 
@@ -149,7 +149,7 @@ list_move(struct list_head *list, struct list_head *head)
 static inline void 
 list_move_tail(struct list_head *list, struct list_head *head)
 {
-        __list_del(list->prev, list->next);
+        list_del_(list->prev, list->next);
         list_add_tail(list, head);
 }
 
@@ -172,7 +172,7 @@ static inline void
 list_splice(struct list_head *list, struct list_head *head)
 {
 	if (!list_empty(list))
-		__list_splice(list, head);
+		list_splice_(list, head);
 }
 
 /**
@@ -186,7 +186,7 @@ static inline void list_splice_init(struct list_head *list,
 				    struct list_head *head)
 {
 	if (!list_empty(list)) {
-		__list_splice(list, head);
+		list_splice_(list, head);
 		INIT_LIST_HEAD(list);
 	}
 }
diff --git a/include/merge_sort.h b/include/merge_sort.h
@@ -40,7 +40,7 @@ namespace alg {
 	 * Merge functions merges the two sorted parts. Sorted parts will be from [left, mid] and [mid+1, right].
 	 */
 	template<typename T>
-		static void __merge(T *array, int left, int mid, int right) {
+		static void merge_(T *array, int left, int mid, int right) {
 			/*We need a Temporary array to store the new sorted part*/
 			T tempArray[right-left+1];
 			int pos=0,lpos = left,rpos = mid + 1;
@@ -75,7 +75,7 @@ namespace alg {
 				/* Sort the right part */
 				merge_sort(array,mid+1,right);
 				/* Merge the two sorted parts */
-				__merge(array,left,mid,right);
+				merge_(array,left,mid,right);
 			}
 		}
 
diff --git a/include/quick_sort.h b/include/quick_sort.h
@@ -25,7 +25,7 @@ namespace alg {
 	 * the quick-sort partition routine
 	 */
 	template<typename T>
-		static int __partition(T list[],int begin, int end) {
+		static int partition_(T list[],int begin, int end) {
 			int pivot_idx = RANDOM(begin,end);
 			T pivot = list[pivot_idx];
 			swap(list[begin], list[pivot_idx]);
@@ -52,7 +52,7 @@ namespace alg {
 	template<typename T>
 		static void quicksort(T list[],int begin,int end) {
 			if( begin < end) {
-				int pivot_idx = __partition<T>(list, begin, end);
+				int pivot_idx = partition_<T>(list, begin, end);
 				quicksort(list, begin, pivot_idx-1);
 				quicksort(list, pivot_idx+1, end);
 			}
diff --git a/include/radix_sort.h b/include/radix_sort.h
@@ -29,7 +29,7 @@ namespace alg {
 	/**
 	 * couting sort
 	 */
-	static void __radix(int byte, const unsigned N, const uint32_t *source, uint32_t *dest) {
+	static void radix_(int byte, const unsigned N, const uint32_t *source, uint32_t *dest) {
 		unsigned count[256];
 		unsigned index[256];
 		memset(count, 0, sizeof (count));
@@ -51,10 +51,10 @@ namespace alg {
 	 */
 	static void radix_sort(uint32_t *source, const unsigned N) {
 		uint32_t * temp = new uint32_t[N];
-		__radix(0, N, source, temp);
-		__radix(1, N, temp, source);
-		__radix(2, N, source, temp);
-		__radix(3, N, temp, source);
+		radix_(0, N, source, temp);
+		radix_(1, N, temp, source);
+		radix_(2, N, source, temp);
+		radix_(3, N, temp, source);
 
 		delete [] temp;
 	}
diff --git a/include/random_select.h b/include/random_select.h
@@ -27,7 +27,7 @@ namespace alg {
 	 * the random_select partition routine
 	 */
 	template<typename T>
-		static int __partition(T list[],int begin, int end) {
+		static int partition_(T list[],int begin, int end) {
 			int pivot_idx = RANDOM(begin,end);
 			T pivot = list[pivot_idx];
 			swap(list[begin],list[pivot_idx]);
@@ -56,7 +56,7 @@ namespace alg {
 			if(begin == end)
 				return begin;
 
-			int pivot_idx = __partition<T>(list, begin, end);
+			int pivot_idx = partition_<T>(list, begin, end);
 			int human_idx = pivot_idx - begin + 1;
 
 			if(k < human_idx)
diff --git a/src/lcs_demo.cpp b/src/lcs_demo.cpp
@@ -6,9 +6,9 @@
 
 #define printlistC(list,n) \
 do { \
-	int __list_counter; \
-	for(__list_counter=0;__list_counter<n;__list_counter++) \
-		printf("%c\t ",list[__list_counter]); \
+	int list_counter_; \
+	for(list_counter_=0;list_counter_<n;list_counter_++) \
+		printf("%c\t ",list[list_counter_]); \
 	printf("\n"); \
 } while(0)
 

Original file line number	Diff line number	Diff line change
`@@ -57,7 +57,7 @@ namespace alg {`
`57`	`57`	`BST():m_root(NULL){};`
`58`	`58`
`59`	`59`	`~BST() {`
`60`		`- __destruct(m_root);`
	`60`	`+ destruct_(m_root);`
`61`	`61`	`}`
`62`	`62`
`63`	`63`	`/**`
`@@ -159,10 +159,10 @@ namespace alg {`
`159`	`159`	`}`
`160`	`160`
`161`	`161`	`private:`
`162`		`- void __destruct(treeNode *n) {`
	`162`	`+ void destruct_(treeNode *n) {`
`163`	`163`	`if (n==NULL) return;`
`164`		`- __destruct(n->left);`
`165`		`- __destruct(n->right);`
	`164`	`+ destruct_(n->left);`
	`165`	`+ destruct_(n->right);`
`166`	`166`	`delete n;`
`167`	`167`	`}`
`168`	`168`
Original file line number	Diff line number	Diff line change
`@@ -39,7 +39,7 @@ struct list_head {`
`39`	`39`	`* the prev/next entries already!`
`40`	`40`	`*/`
`41`	`41`	`static inline void`
`42`		`-__list_add(struct list_head *n,`
	`42`	`+list_add_(struct list_head *n,`
`43`	`43`	`struct list_head *prev,`
`44`	`44`	`struct list_head *next)`
`45`	`45`	`{`
`@@ -57,14 +57,14 @@ __list_add(struct list_head *n,`
`57`	`57`	`* the prev/next entries already!`
`58`	`58`	`*/`
`59`	`59`	`static inline void`
`60`		`-__list_del(struct list_head prev, struct list_head next)`
	`60`	`+list_del_(struct list_head prev, struct list_head next)`
`61`	`61`	`{`
`62`	`62`	`next->prev = prev;`
`63`	`63`	`prev->next = next;`
`64`	`64`	`}`
`65`	`65`
`66`	`66`	`static inline void`
`67`		`-__list_splice(struct list_head list, struct list_head head)`
	`67`	`+list_splice_(struct list_head list, struct list_head head)`
`68`	`68`	`{`
`69`	`69`	`struct list_head *first = list->next;`
`70`	`70`	`struct list_head *last = list->prev;`
`@@ -88,7 +88,7 @@ __list_splice(struct list_head list, struct list_head head)`
`88`	`88`	`static inline void`
`89`	`89`	`list_add(struct list_head n, struct list_head head)`
`90`	`90`	`{`
`91`		`- __list_add(n, head, head->next);`
	`91`	`+ list_add_(n, head, head->next);`
`92`	`92`	`}`
`93`	`93`
`94`	`94`	`/**`
`@@ -102,7 +102,7 @@ list_add(struct list_head n, struct list_head head)`
`102`	`102`	`static inline void`
`103`	`103`	`list_add_tail(struct list_head n, struct list_head head)`
`104`	`104`	`{`
`105`		`- __list_add(n, head->prev, head);`
	`105`	`+ list_add_(n, head->prev, head);`
`106`	`106`	`}`
`107`	`107`
`108`	`108`	`/**`
`@@ -113,7 +113,7 @@ list_add_tail(struct list_head n, struct list_head head)`
`113`	`113`	`static inline void`
`114`	`114`	`list_del(struct list_head *entry)`
`115`	`115`	`{`
`116`		`- __list_del(entry->prev, entry->next);`
	`116`	`+ list_del_(entry->prev, entry->next);`
`117`	`117`	`entry->next = NULL;`
`118`	`118`	`entry->prev = NULL;`
`119`	`119`	`}`
`@@ -125,7 +125,7 @@ list_del(struct list_head *entry)`
`125`	`125`	`static inline void`
`126`	`126`	`list_del_init(struct list_head *entry)`
`127`	`127`	`{`
`128`		`- __list_del(entry->prev, entry->next);`
	`128`	`+ list_del_(entry->prev, entry->next);`
`129`	`129`	`INIT_LIST_HEAD(entry);`
`130`	`130`	`}`
`131`	`131`
`@@ -137,7 +137,7 @@ list_del_init(struct list_head *entry)`
`137`	`137`	`static inline void`
`138`	`138`	`list_move(struct list_head list, struct list_head head)`
`139`	`139`	`{`
`140`		`- __list_del(list->prev, list->next);`
	`140`	`+ list_del_(list->prev, list->next);`
`141`	`141`	`list_add(list, head);`
`142`	`142`	`}`
`143`	`143`
`@@ -149,7 +149,7 @@ list_move(struct list_head list, struct list_head head)`
`149`	`149`	`static inline void`
`150`	`150`	`list_move_tail(struct list_head list, struct list_head head)`
`151`	`151`	`{`
`152`		`- __list_del(list->prev, list->next);`
	`152`	`+ list_del_(list->prev, list->next);`
`153`	`153`	`list_add_tail(list, head);`
`154`	`154`	`}`
`155`	`155`
`@@ -172,7 +172,7 @@ static inline void`
`172`	`172`	`list_splice(struct list_head list, struct list_head head)`
`173`	`173`	`{`
`174`	`174`	`if (!list_empty(list))`
`175`		`- __list_splice(list, head);`
	`175`	`+ list_splice_(list, head);`
`176`	`176`	`}`
`177`	`177`
`178`	`178`	`/**`
`@@ -186,7 +186,7 @@ static inline void list_splice_init(struct list_head *list,`
`186`	`186`	`struct list_head *head)`
`187`	`187`	`{`
`188`	`188`	`if (!list_empty(list)) {`
`189`		`- __list_splice(list, head);`
	`189`	`+ list_splice_(list, head);`
`190`	`190`	`INIT_LIST_HEAD(list);`
`191`	`191`	`}`
`192`	`192`	`}`