예제 #1
0
        public static Status ListTraverse(LinearList L, Visit visit)
        {
            Visit v = new Visit(visit);

            v(1);
            return(Status.OK);
        }
예제 #2
0
        static void Main(string[] args)
        {
            LinearList <int> listA = new LinearList <int>();

            LinearList <int> .InitList(ref listA);

            LinearList <int> .ListTraverse(listA, Visit <int>);
        }
예제 #3
0
 public static Status NextElem(LinearList L, int cur_e, ref int next_e)
 {
     return(Status.OK);
 }
예제 #4
0
 public static Status PriorElem(LinearList L, int cur_e, ref int pre_e)
 {
     return(Status.OK);
 }
예제 #5
0
 public static int LocateElem(LinearList L, int elem, Comparer <int> comp)
 {
     return(0);
 }
예제 #6
0
 public static Status GetElem(LinearList L, int i, ref int elem)
 {
     return(Status.OK);
 }
예제 #7
0
 public static int ListLenght(LinearList L)
 {
     return(-1);
 }
예제 #8
0
 public static Status ListEmpty(LinearList L)
 {
     return(Status.TRUE);
 }
예제 #9
0
 public static Status ClearList(ref LinearList L)
 {
     return(Status.OK);
 }
예제 #10
0
 public static Status DestroyList(ref LinearList L)
 {
     return(Status.OK);
 }
예제 #11
0
 public static Status ListDelete(ref LinearList L, int i, int elem)
 {
     return(Status.OK);
 }
예제 #12
0
 public static Status ListInsert(ref LinearList L, int i, int elem)
 {
     return(Status.OK);
 }