package Binary;
public class SinglyList<T> extends Object{
public Node<T> head;
public SinglyList()
{
this.head=new Node<T>();
}
public SinglyList(T[] values)
{
this();
Node<T>rear=this.head;
for(int i=0;i<values.length;i++)
{
rear.next=new Node<T>(values[i],null);
rear=rear.next;
}
}
public SinglyList(SinglyList<T>list)
{ this();
Node<T> rear=this.head;
for (Node<T> p=list.head.next; p!=null; p=p.next)
{ rear.next = new Node<T>(p.date, null);
rear = rear.next;
}
}
public boolean isEmpty()
{
return this.head.next==null;
}
public T get(int i)
{
Node<T>p=this.head.next;
for(int j=0;p!=null&&j<i;j++)
p=p.next;
return(i>=0&&p!=null)?p.date:null;
}
public void set(int i,T x)
{
Node<T>p=head.next;
if(i<this.size()&&x!=null) {
for(int j=0;j<i;j++)
p=p.next;
p.date=x;}
}
public int size()
{
int i=0;
Node<T>p=head;
while(p!=null) {
p=p.next;
i++;}
return i;
}
public String toString()
{
String str=this.getClass().getName()+"(";
for(Node<T>p=this.head.next;p!=null;p=p.next)
{
str+=p.date.toString();
if(p.next!=null)
str+=",";
}
return str+")";
}
public Node<T>insert(int i,T x)
{
if(x==null)
throw new NullPointerException("x==null");
Node<T>front=this.head;
for(int j=0;front.next!=null&&j<i;j++)
front=front.next;
front.next=new Node<T>(x,front.next);
return front.next;
}
public Node<T> insert(T x)
{
return insert(Integer.MAX_VALUE,x);
}
public T remove(int i)
{
Node<T> front=this.head;
for(int j=0;front.next!=null&&j<i;j++)
front=front.next;
if(i>=0&&front.next!=null)
{
T old=front.next.date;
front.next=front.next.next;
return old;
}
return null;
}
public void clear()
{
this.head.next=null;
}
public SinglyList(SinglyList<T> list, boolean asc)
{
this();
Node<T> rear=this.head;
Node<T> p=null;
Node<T> q=rear.next;
for(Node<T>r=list.head.next;r!=null;r=r.next)
{
int i=(int)p.date;
int j=(int)r.date;
if(asc)
if(i>=j)
q.date=r.date;
else
p=new Node<T>(r.date,p.next);
else if(i<=j)
q.date=r.date;
else p=new Node<T>(r.date,p.next);
p=q;
q=new Node<T>(null,head);
}
}
}
