blob: 93a9fcbea717f767902ca232b5e552ce8aab74ec (
plain)
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
|
#include "Deque.h"
#include <windows.h>
CDeque::CDeque(void)
{
top1=0;
top2=0;
head=NULL;
tail=NULL;
}
CDeque::~CDeque(void)
{
}
void CDeque::push_front(wchar_t *str)
{
CNode *temp;
if(top1+top2 >= MAX_DEQUE)
{
return ;
}
if(top1+top2 == 0)
{
head = new CNode;
wcscpy(head->str, str);
head->next=NULL;
head->prev=NULL;
tail=head;
top1++;
}
else
{
top1++;
temp=new CNode;
wcscpy(temp->str, str);
temp->next=head;
temp->prev=NULL;
head->prev=temp;
head=temp;
}
}
void CDeque::push_back(wchar_t *str)
{
CNode *temp;
if(top1+top2 >= MAX_DEQUE)
{
return ;
}
if(top1+top2 == 0)
{
head = new CNode;
wcscpy(head->str, str);
head->next=NULL;
head->prev=NULL;
tail=head;
top1++;
}
else
{
top2++;
temp=new CNode;
wcscpy(temp->str, str);
temp->next=NULL;
temp->prev=tail;
tail->next=temp;
tail=temp;
}
}
int CDeque::size()
{
return top1 + top2;
}
wchar_t *CDeque::at(int pos)
{
int i=0;
CNode *temp;
if(top1+top2 <= 0)
{
return NULL;
}
temp=head;
while(temp!=NULL)
{
if(i==pos)
return temp->str;
temp=temp->next;
i++;
}
return NULL;
}
|
