public static Status ListTraverse(LinearList L, Visit visit)
{
Visit v = new Visit(visit);
v(1);
return(Status.OK);
}
static void Main(string[] args)
{
LinearList <int> listA = new LinearList <int>();
LinearList <int> .InitList(ref listA);
LinearList <int> .ListTraverse(listA, Visit <int>);
}
public static Status NextElem(LinearList L, int cur_e, ref int next_e)
{
return(Status.OK);
}
public static Status PriorElem(LinearList L, int cur_e, ref int pre_e)
{
return(Status.OK);
}
public static int LocateElem(LinearList L, int elem, Comparer <int> comp)
{
return(0);
}
public static Status GetElem(LinearList L, int i, ref int elem)
{
return(Status.OK);
}
public static int ListLenght(LinearList L)
{
return(-1);
}
public static Status ListEmpty(LinearList L)
{
return(Status.TRUE);
}
public static Status ClearList(ref LinearList L)
{
return(Status.OK);
}
public static Status DestroyList(ref LinearList L)
{
return(Status.OK);
}
public static Status ListDelete(ref LinearList L, int i, int elem)
{
return(Status.OK);
}
public static Status ListInsert(ref LinearList L, int i, int elem)
{
return(Status.OK);
}
