Code:
#include iostream
#include cstdio
#include cstdlib
using namespace std;
/*
* Sublist Declaration
*/
struct sublist
{
struct sublist* next;
int *buf;
};
/*
* Vlist Node Declaration
*/
typedef struct vlist_t
{
sublist* head;
int last_size, ofs;
}*vlist;
/*
* Vlist Class Declaration
*/
class v_list
{
public:
sublist *sublist_new(int);
vlist v_new();
void v_del(vlist);
int v_size(vlist);
int* v_addr(vlist, int);
int v_elem(vlist, int);
int* v_unshift(vlist, int);
int v_shift(vlist);
v_list()
{}
};
/*
* Main:Conatins Menu
*/
int main()
{
int i, x, choice;
v_list vl;
vlist v = vl.v_new();
while (1)
{
cout<<"\n------------------"<
cout<<"Operations on Vlist "<
cout<<"\n------------------"<
cout<<"1.Insert Element to the front of Vlist"<
cout<<"2.Compute length of Vlist"<
cout<<"3.Find k-th Element"<
cout<<"4.Remove Element from Vlist"<
cout<<"5.Display Vlist Elements"<
cout<<"6.Quit"<
cout<<"Enter your Choice: ";
cin>>choice;
cout<
switch(choice)
{
case 1:
cout<<"Enter element to be inserted: ";
cin>>x;
vl.v_unshift(v, x);
break;
case 2:
cout<<"Size of Vlist: ";
cout<
break;
case 3:
cout<<"Enter position of element to locate: ";
cin>>x;
if (x > vl.v_size(v))
cout<<"Position out of range"<
else
cout<<"Element at position "<
break;
case 4:
cout<<"Element Removed: "<
break;
case 5:
cout<<"Displaying Elements of Vlist"<
for (i = 0;i < vl.v_size(v);i++)
cout<
cout<
break;
case 6:
exit(1);
break;
default:
cout<<"Wrong Choice"<
}
}
vl.v_del(v);
return 0;
}
/*
* Creating new sublist
*/
sublist *v_list::sublist_new(int s)
{
sublist* sub = (sublist *)malloc(sizeof(sublist) + sizeof(int) * s);
sub->buf = (int*)(sub + 1);
sub->next = 0;
return sub;
}
/*
* Creating Vlist from Sublist
*/
vlist v_list::v_new()
{
vlist v = new(vlist_t);
v->head = sublist_new(1);
v->last_size = 1;
v->ofs = 0;
return v;
}
/*
* Deleting Vlist
*/
void v_list::v_del(vlist v)
{
sublist *s;
while (v->head)
{
s = v->head->next;
free(v->head);
v->head = s;
}
free(v);
}
/*
* Compute Length of Vlist
*/
int v_list::v_size(vlist v)
{
return v->last_size * 2 - v->ofs - 2;
}
int *v_list::v_addr(vlist v, int idx)
{
sublist *s = v->head;
int top, i;
top = v->last_size;
i = idx + v->ofs;
if (i + 2 >= (top << 1))
{
cout<<"!: idx "<
abort();
}
while (s && i >= top)
{
s = s->next;
i ^= top;
top >>= 1;
}
return s->buf + i;
}
/*
* Locate Element at any position in the Vlist
*/
int v_list::v_elem(vlist v, int idx)
{
return *v_addr(v, idx);
}
/*
* Add Element in the Vlist
*/
int *v_list::v_unshift(vlist v, int x)
{
sublist* s;
int *p;
if (!v->ofs)
{
if (!(s = sublist_new(v->last_size << 1)))
{
cout<<"allocation failure"<
return 0;
}
v->ofs = (v->last_size <<= 1);
s->next = v->head;
v->head = s;
}
*(p = v->head->buf + --v->ofs) = x;
return p;
}
/*
* Remove Element from the Vlist
*/
int v_list::v_shift(vlist v)
{
sublist* s;
int x;
if (v->last_size == 1 && v->ofs == 1)
{
cout<<"empty list"<
abort();
}
x = v->head->buf[v->ofs++];
if (v->ofs == v->last_size)
{
v->ofs = 0;
if (v->last_size > 1)
{
s = v->head;
v->head = s->next;
v->last_size >>= 1;
free(s);
}
}
return x;
}
Output:
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 2
Size of Vlist: 0
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 5
Displaying Elements of Vlist
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 1
Enter element to be inserted: 100
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 2
Size of Vlist: 1
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 1
Enter element to be inserted: 200
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 1
Enter element to be inserted: 300
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 2
Size of Vlist: 3
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 5
Displaying Elements of Vlist
300 200 100
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 3
Enter position of element to locate: 2
Element at position 2: 200
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 4
Element Removed: 300
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 2
Size of Vlist: 2
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 5
Displaying Elements of Vlist
200 100
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 1
Enter element to be inserted: 400
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 2
Size of Vlist: 3
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 1
Enter element to be inserted: 500
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 1
Enter element to be inserted: 600
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 2
Size of Vlist: 5
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 5
Displaying Elements of Vlist
600 500 400 200 100
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 2
Size of Vlist: 5
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 3
Enter position of element to locate: 1
Element at position 1: 600
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 4
Element Removed: 600
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 5
Displaying Elements of Vlist
500 400 200 100
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 2
Size of Vlist: 4
------------------
Operations on Vlist
------------------
1.Insert Element to the front of Vlist
2.Compute length of Vlist
3.Find k-th Element
4.Remove Element from Vlist
5.Display Vlist Elements
6.Quit
Enter your Choice: 6
------------------
(program exited with code: 1)
Press return to continue
More C++ Programs:
