-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMap.java
More file actions
144 lines (112 loc) · 2.63 KB
/
Map.java
File metadata and controls
144 lines (112 loc) · 2.63 KB
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
// class Map [Ditto like Sequence]
class Map {
private MapIterator mapIterator;
private Sequence head;
private MapIterator set;
private int length;
private boolean flag = false;
Pair temp;
public Map(){
head = new Sequence(null);
set = new MapIterator();
temp = new Pair(null, null);
temp = null;
}
public MapIterator begin(){
mapIterator = new MapIterator();
mapIterator.set(this);
return this.mapIterator;
}
public MapIterator end(){
MapIterator s = new MapIterator();
Map end = new Map();
end = this;
end.set.set(this);
s = set;
if(!flag){
s.mapGet().add(temp);
flag = true;
}
for (int pos = 0; pos < this.length(); pos++){
if(pos > 0)
s.advance();
}
return s;
}
public Pair first(){
Sequence currentNode = head;
if(this.length() == 0){
return null;
}
return (Pair) currentNode.getNext().getData();
}
public Map rest(){
Map newSeq = new Map();
newSeq.head = this.head.getNext();
newSeq.length = this.length - 1;
return newSeq;
}
public void add(Pair val)
{
Sequence newNode = new Sequence(val);
Sequence currentNode = head;
if(val == null)
return;
for(int i = 0; currentNode.getNext() != null ; i++){
if((val.getKey().Get() > ((Pair)currentNode.getNext().getData()).getKey().Get()
|| val.getKey().Get() ==((Pair)currentNode.getNext().getData()).getKey().Get())
&& currentNode.getNext() != null)
{
currentNode = currentNode.getNext();
}
else
break;
}
newNode.setNext(currentNode.getNext());
currentNode.setNext(newNode);
length++;
}
public int length()
{
int size = 0;
Sequence currentNode = head.getNext();
while (currentNode != null){
currentNode = currentNode.getNext();
size++;
}
if(length == size)
return length;
else
return size;
}
public MapIterator find(MyChar key)
{
MapIterator start = new MapIterator();
Pair p = new Pair(null, null);
MyChar set = new MyChar();
for(start = this.begin(); !start.equal(this.end()); start.advance()){
p = start.get();
set = p.getKey();
if(key.Get() == set.Get())
break;
}
return start;
}
public void Print(){
Pair data;
Sequence currentNode = head.getNext();
System.out.print("[ ");
while (currentNode != null) {
data = (Pair)currentNode.getData();
data.Print();
currentNode = currentNode.getNext();
if(currentNode != null){
System.out.print(" ");
}
}
System.out.print(" ]");
}
public Sequence returnH(){
return head;
}
}