FilesExpand file tree

 master

/

doublelist.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

148 lines (125 loc) · 2.68 KB

 master

/

doublelist.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

148 lines (125 loc) · 2.68 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

#include "doublelist.h"

void createList(List &L) {

first(L) = NULL;

last(L) = NULL;

}

address allocate(infotype x) {

address P;

P = new elmlist;

info(P) = x;

next(P) = NULL;

prev(P) = NULL;

return P;

}

void deallocate(address &P) {

delete P;

P = NULL;

}

void printInfo(List L) {

if(first(L)!=NULL &&last(L)!=NULL) {

address P = first(L);

while(P!=last(L)) {

cout<<info(P)<<", ";

P = next(P);

}

cout<<info(P)<<", ";

}

cout<<endl;

}

void insertLast(List &L, address P) {

if(first(L)!=NULL && last(L)!=NULL) {

prev(P) = last(L);

next(last(L)) = P;

last(L) = P;

} else {

first(L) = P;

last(L) = P;

}

}

void deleteFirst(List &L, address &P) {

if(first(L)==last(L)){

P = first(L);

first(L)=NULL;

last(L)=NULL;

}

else if(next(first(L))==last(L)){

P= last(L);

last(L)=first(L);

next(first(L))=NULL;

prev(P)=NULL;

}else{

P = first(L);

first(L) = next(P);

next(P)= NULL;

prev(first(L)) = NULL;

}

}

void insertFirst(List &L, address P) {

if(first(L)!=NULL && last(L)!=NULL) {

next(P) = first(L);

prev(first(L)) = P;

first(L) = P;

} else {

first(L) = P;

last(L) = P;

}

}

address findElement(List L, infotype x) {

address P = first(L);

while ((info(P) != x)&&(next(P) != NULL)){

P = next(P);

}

if (info(P)== x){

return P;

}else{

return NULL;

}

}

void insertAfter(List &L, address Prec, address P) {

if(Prec != NULL){

if(next(Prec)==NULL){

insertLast(L,P);

}

else{

next(P) = next(Prec);

prev(next(Prec))= P;

next(Prec)=P;

prev(P)=Prec;

}

}

}

void deleteLast(List &L, address &P) {

if(first(L)==last(L)){

P = first(L);

first(L)=NULL;

last(L)=NULL;

}

else if(next(first(L))==last(L)){

P= last(L);

last(L)=first(L);

next(first(L))=NULL;

prev(P)=NULL;

}

else if(last(L) != NULL){

P = last(L);

last(L) = prev(P);

next(prev(P))=NULL;

prev(P)=NULL;

}

}

void deleteAfter(List &L, address Prec, address &P) {

if(Prec != NULL){

if(next(Prec)!=NULL){

if(next(Prec)==last(L)){

deleteLast(L,P);

}

else{

P = next(Prec);

next(Prec)=next(P);

prev(next(P)) = Prec;

next(P) = NULL;

prev(P) = NULL;

}

}

}

}