Data-Structures/SimpleLinkedList/Tests/testSingleLinkedList1.mod

MODULE testSingleLinkedList1;

IMPORT SingleLinkedList;
FROM InOut IMPORT Write, WriteLn, WriteString, WriteCard;

VAR 
  oneList : SingleLinkedList.List;
  ok : BOOLEAN;

BEGIN
  SingleLinkedList.Init(oneList, FALSE , NIL );
  IF SingleLinkedList.Empty(oneList) THEN
    WriteString("liste vide");
    WriteLn
  ELSE
    WriteString("y'a un stuck ;) ");
    WriteLn
  END;    
  SingleLinkedList.AddElementLast(oneList);
  IF SingleLinkedList.Empty(oneList) THEN
    WriteString("liste vide");
    WriteLn
  ELSE
    WriteString("y'a un element :) ");
    (* test de position *)
    WriteCard(oneList^.lastElement^.pos ,5);
    WriteCard(SingleLinkedList.GetPosCurrentElement(oneList), 5);
    WriteCard(SingleLinkedList.GetPosLastElement(oneList), 5);
    WriteLn;
  END; 
  
   SingleLinkedList.AddElementLast(oneList);
  IF SingleLinkedList.Empty(oneList) THEN
    WriteString("liste vide");
    WriteLn
  ELSE
    WriteString("y'a un element :) ");
    (* test de position *)
    WriteCard(oneList^.lastElement^.pos ,5);
    WriteCard(SingleLinkedList.GetPosCurrentElement(oneList), 5);
    WriteCard(SingleLinkedList.GetPosLastElement(oneList), 5);
    WriteLn;
  END;  
  
  
  (* test de SetPos : 2 cas *)
  
  (* cas 1 où pos est dans l'intervalle des positions actuelles *)
  
  ok := SingleLinkedList.SetPos(oneList,0);
  IF ok THEN
    WriteString("OK !"); WriteLn;
  ELSE
    WriteString("Not ok!!!!!!!"); WriteLn
  END;  
  
  
  (* cas 2 où pos est hors intervalle *)
  ok := SingleLinkedList.SetPos(oneList,5);
  IF ok THEN
    WriteString("OK !"); WriteLn;
  ELSE
    WriteString("Not ok!!!!!!!"); WriteLn
  END;   
  SingleLinkedList.Free (oneList);
  
  
  
  
END testSingleLinkedList1.