public int[] allEle(int j) { hole tmp = head; int s = size(); int[] arr = new int[s]; if (j == 0) { for (int i = 0; i < s; i++) { arr[i] = tmp.get_start(); tmp = tmp.get_next(); } } else if (j == 1) { for (int i = 0; i < s; i++) { arr[i] = tmp.get_end(); tmp = tmp.get_next(); } } else if (j == 2) { for (int i = 0; i < s; i++) { arr[i] = tmp.get_size(); tmp = tmp.get_next(); } } return(arr); }
public hole last() { if (isEmpty()) { return(null); } hole tmp = head; while (tmp.get_next() != null) { tmp = tmp.get_next(); } return(tmp); }
public hole findBySize(int i) { hole tmp = head; while (tmp.get_size() != i) { tmp = tmp.get_next(); } return(tmp); }
public hole findByEnd(int i) { hole tmp = head; while (tmp.get_end() != i) { tmp = tmp.get_next(); } return(tmp); }
public hole findByHoleNum(int i) { if (isEmpty()) { return(null); } hole tmp = head; while (tmp.get_holeNum() != i && tmp.get_next() != null) { tmp = tmp.get_next(); } if (tmp.get_holeNum() == i) { return(tmp); } else { return(null); } }
public void printHoles() { mMem.sort(0); hole holes = mMem.get_hHole(); int size = mMem.size(); for (int i = 0; i < size; i++) { int start = holes.get_start(); int end = holes.get_end(); listBox1.Items.Add(mTxt1Hole + start + " to " + end); holes = holes.get_next(); } }
public void remove(hole h) { hole tmp = head; if (size() == 1) { head = null; return; } else if (tmp == h) { head = tmp.get_next(); return; } else { while (tmp.get_next() != h && tmp.get_next() != null) { tmp = tmp.get_next(); } hole tmp2 = tmp.get_next(); tmp.set_next(tmp2.get_next()); } }
public int holeSize() { if (isEmpty()) { return(0); } hole tmp = head; int i = 0; while (tmp != null) { i = i + tmp.get_size(); tmp = tmp.get_next(); } return(i); }
public int size() { if (isEmpty()) { return(0); } int i = 1; hole tmp = head.get_next(); while (tmp != null) { i++; tmp = tmp.get_next(); } return(i); }
public void sort(int sel) { hole tmp = head; int n = size(); int x, y; if (sel == 0) { for (x = 0; x < n; x++) { hole tmp2 = tmp.get_next(); for (y = 0; y < n - x - 1; y++) { int c = tmp.get_start(); int nn = tmp2.get_start(); if (c > nn) { swap(tmp, tmp2); } tmp2 = tmp2.get_next(); } tmp = tmp.get_next(); } } else if (sel == 1) { for (x = 0; x < n; x++) { hole tmp2 = tmp.get_next(); for (y = 0; y < n - x - 1; y++) { int c = tmp.get_end(); int nn = tmp2.get_end(); if (c > nn) { swap(tmp, tmp2); } tmp2 = tmp2.get_next(); } tmp = tmp.get_next(); } } else if (sel == 2) { for (x = 0; x < n; x++) { hole tmp2 = tmp.get_next(); for (y = 0; y < n - x - 1; y++) { int c = tmp.get_size(); int nn = tmp2.get_size(); if (c > nn) { swap(tmp, tmp2); } tmp2 = tmp2.get_next(); } tmp = tmp.get_next(); } } }