main()
{
int choice,data;
struct node *start=NULL;
while(1)
{
printf("1.Insert\n");
printf("2.Display\n");
printf("3.Search\n");
printf("4.Exit\n");
printf("Enter your choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("Enter the element to be inserted : ");
scanf("%d",&data);
start=insert_s(start,data);
break;
case 2:
display(start);
break;
case 3:
printf("Enter the element to be searched : ");
scanf("%d",&data);
search(start,data);
break;
case 4:
exit(1);
default:
printf("Wrong choice\n");
}/*End of switch*/
}/*End of while*/
} /*end of main */
/* Function to create a new node with given data */
struct node *create(struct node *head)
{
int index, num, data;
printf("Enter the number of nodes : ");
scanf_s("%d", &num);
head = NULL;
for (index = 1; index <= num; index++)
{
printf("Enter the element to be inserted : ");
scanf_s("%d", &data);
head = insert_s(head, data);
}
return head;
}//End of create_slist()
main()
{
int i,n,data;
struct node *start=NULL;
printf("Enter the number of elements : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
printf("Enter the element to be inserted : ");
scanf("%d",&data);
start=insert_s(start,data);
}
display(start);
deleteDuplicates(start);
display(start);
}/*End of main()*/
TaggedString *luaS_newlstr (char *str, long l)
{
int i = (l==0)?0:(unsigned char)str[0];
return insert_s(str, l, &L->string_root[i%NUM_HASHS]);
}
static int r_Step_1b(struct SN_env * z) {
int among_var;
z->ket = z->c; /* [, line 34 */
among_var = find_among_b(z, a_2, 3); /* substring, line 34 */
if (!(among_var)) return 0;
z->bra = z->c; /* ], line 34 */
switch(among_var) {
case 0: return 0;
case 1:
{ int ret = r_R1(z);
if (ret == 0) return 0; /* call R1, line 35 */
if (ret < 0) return ret;
}
{ int ret;
ret = slice_from_s(z, 2, s_2); /* <-, line 35 */
if (ret < 0) return ret;
}
break;
case 2:
{ int m_test = z->l - z->c; /* test, line 38 */
while(1) { /* gopast, line 38 */
if (!(in_grouping_b_U(z, g_v, 97, 121))) goto lab0;
break;
lab0:
{ int c = skip_utf8(z->p, z->c, z->lb, 0, -1);
if (c < 0) return 0;
z->c = c; /* gopast, line 38 */
}
}
z->c = z->l - m_test;
}
{ int ret;
ret = slice_del(z); /* delete, line 38 */
if (ret < 0) return ret;
}
{ int m_test = z->l - z->c; /* test, line 39 */
among_var = find_among_b(z, a_1, 13); /* substring, line 39 */
if (!(among_var)) return 0;
z->c = z->l - m_test;
}
switch(among_var) {
case 0: return 0;
case 1:
{ int ret;
{ int c = z->c;
ret = insert_s(z, z->c, z->c, 1, s_3); /* <+, line 41 */
z->c = c;
}
if (ret < 0) return ret;
}
break;
case 2:
z->ket = z->c; /* [, line 44 */
{ int c = skip_utf8(z->p, z->c, z->lb, 0, -1);
if (c < 0) return 0;
z->c = c; /* next, line 44 */
}
z->bra = z->c; /* ], line 44 */
{ int ret;
ret = slice_del(z); /* delete, line 44 */
if (ret < 0) return ret;
}
break;
case 3:
if (z->c != z->I[0]) return 0; /* atmark, line 45 */
{ int m_test = z->l - z->c; /* test, line 45 */
{ int ret = r_shortv(z);
if (ret == 0) return 0; /* call shortv, line 45 */
if (ret < 0) return ret;
}
z->c = z->l - m_test;
}
{ int ret;
{ int c = z->c;
ret = insert_s(z, z->c, z->c, 1, s_4); /* <+, line 45 */
z->c = c;
}
if (ret < 0) return ret;
}
break;
}
break;
}
return 1;
}
static int r_Step_1b(struct SN_env * z) {
int among_var;
z->ket = z->c; /* [, line 74 */
among_var = find_among_b(z, a_4, 6); /* substring, line 74 */
if (!(among_var)) return 0;
z->bra = z->c; /* ], line 74 */
switch(among_var) {
case 0: return 0;
case 1:
{ int ret = r_R1(z);
if (ret == 0) return 0; /* call R1, line 76 */
if (ret < 0) return ret;
}
{ int ret;
ret = slice_from_s(z, 2, s_8); /* <-, line 76 */
if (ret < 0) return ret;
}
break;
case 2:
{ int m_test = z->l - z->c; /* test, line 79 */
while(1) { /* gopast, line 79 */
if (!(in_grouping_b(z, g_v, 97, 121))) goto lab0;
break;
lab0:
if (z->c <= z->lb) return 0;
z->c--; /* gopast, line 79 */
}
z->c = z->l - m_test;
}
{ int ret;
ret = slice_del(z); /* delete, line 79 */
if (ret < 0) return ret;
}
{ int m_test = z->l - z->c; /* test, line 80 */
among_var = find_among_b(z, a_3, 13); /* substring, line 80 */
if (!(among_var)) return 0;
z->c = z->l - m_test;
}
switch(among_var) {
case 0: return 0;
case 1:
{ int ret;
{ int c = z->c;
ret = insert_s(z, z->c, z->c, 1, s_9); /* <+, line 82 */
z->c = c;
}
if (ret < 0) return ret;
}
break;
case 2:
z->ket = z->c; /* [, line 85 */
if (z->c <= z->lb) return 0;
z->c--; /* next, line 85 */
z->bra = z->c; /* ], line 85 */
{ int ret;
ret = slice_del(z); /* delete, line 85 */
if (ret < 0) return ret;
}
break;
case 3:
if (z->c != z->I[0]) return 0; /* atmark, line 86 */
{ int m_test = z->l - z->c; /* test, line 86 */
{ int ret = r_shortv(z);
if (ret == 0) return 0; /* call shortv, line 86 */
if (ret < 0) return ret;
}
z->c = z->l - m_test;
}
{ int ret;
{ int c = z->c;
ret = insert_s(z, z->c, z->c, 1, s_10); /* <+, line 86 */
z->c = c;
}
if (ret < 0) return ret;
}
break;
}
break;
}
return 1;
}
TaggedString *luaS_newlstr (const char *str, int32 l)
{
int32 i = (l==0)?0:(byte)str[0];
return insert_s(str, l, &L->string_root[i%NUM_HASHS]);
}
