3 public class Liste
extends Structure
{
4 private Node
<Integer
> headNode
;
5 private int list_counter
;
12 private boolean isEmpty()
14 return getHeadNode() == null;
17 public int getSize() {
21 public void setSize(int size
) {
25 public void setHeadNode(Node
<Integer
> node
) {
29 public Node
<Integer
> getHeadNode() {
33 public boolean inserer(int value
) {
34 boolean found
= false;
36 headNode
= new Node
<Integer
>(value
);
39 } else if (value
== headNode
.getData()) {
43 Node
<Integer
> nodeCursorNext
= headNode
.getNext();
44 while (nodeCursorNext
!= null) {
45 if (value
== nodeCursorNext
.getData()) {
49 nodeCursorNext
= nodeCursorNext
.getNext();
53 headNode
= new Node
<Integer
>(value
, headNode
);
56 // Insertion in a linked list can't fail
61 public boolean supprimer(int value
) {
62 boolean deleted
= false;
65 } else if (value
== headNode
.getData()) {
66 headNode
= headNode
.getNext();
70 Node
<Integer
> nodeCursor
= headNode
;
71 Node
<Integer
> nodeCursorNext
= headNode
.getNext();
72 while (nodeCursorNext
!= null) {
73 if (value
== nodeCursorNext
.getData()) {
74 nodeCursor
.setNext(nodeCursorNext
.getNext());
79 nodeCursor
= nodeCursorNext
;
80 nodeCursorNext
= nodeCursorNext
.getNext();
87 public void afficher() {
88 String className
= this.getClass().getSimpleName();
90 System
.out
.println("---- " + className
+ " ----");
93 } else if (headNode
.getNext() == null) {
94 System
.out
.println("element " + i
+ " : " + headNode
.getData());
96 Node
<Integer
> nodeCursorNext
= headNode
.getNext();
97 System
.out
.println("element " + i
+ " : " + headNode
.getData());
99 while (nodeCursorNext
!= null) {
100 System
.out
.println("element " + i
+ " : " + nodeCursorNext
.getData());
101 nodeCursorNext
= nodeCursorNext
.getNext();