/**
 * Implementacin de lista simplemente enlazada.
 * @author Jordi
 *
 */
public class ListaPR {
	PullRequest first;
	
	public ListaPR() {
		first = new PullRequest(null);
	}
	
	public void insertarPR(String t) {
		PullRequest newNode = new PullRequest(t);
		if(isEmpty()) {
			first.next = newNode;
		}
		else {
			PullRequest aux = first;
			while(aux.next != null) {
				aux = aux.next;
			}
			aux.next = newNode;
		}
	}
	
	public int getSize() {
		int i = 0;
		PullRequest aux = first;
		while(aux.next != null) {
			aux = aux.next;
			i++;
		}
		return i;
	}
	
	public boolean isEmpty() {
		if(first.next == null) {
			return true;
		}
		return false;
	}
	
	public PullRequest getFirst() {
		return first.next;
	}
	
	public void listPRs() {
		PullRequest aux = first;
		while(aux.next != null) {
			System.out.println(aux.titulo);
			aux = aux.next;
		}
	}
	
	public void deletePR(String title) {
		
	}
	
	public void searchPR(String title) {
		
	}
}

@@ -12,16 +12,17 @@
 ementaci
+%C3%B3
 n de lis
@@ -798,16 +798,35 @@
 null) %7B%0A
+%09%09%09aux = aux.next;%0A
 %09%09%09Syste
@@ -852,35 +852,16 @@
 itulo);%0A
-%09%09%09aux = aux.next;%0A
 %09%09%7D%0A%09%7D%0A%09

Update listPRs()