winsdominoes
/
vendor-info
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

added calling purchase function

This commit is contained in:
Win 2024-09-03 13:00:50 +07:00
parent 2656180e25
commit b6b164f434
1 changed files with 25 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
vendorInfo.c
View File

@ -86,7 +86,6 @@ int main()
} }
char user_query[100]; char user_query[100];
read_input(user_query, 100);
while (1) while (1)
{ {
@ -95,7 +94,9 @@ int main()
break; break;
} }
printf("What do you want to buy? (DONE to end) ");
read_input(user_query, 100); read_input(user_query, 100);
// convert string to lowercase - each character one by one // convert string to lowercase - each character one by one
int user_query_length = strlen(user_query); int user_query_length = strlen(user_query);
for (int i = 0; i < user_query_length; i++) for (int i = 0; i < user_query_length; i++)
@ -103,7 +104,28 @@ int main()
user_query[i] = tolower(user_query[i]); user_query[i] = tolower(user_query[i]);
}; };
search(user_query, vendors, total_vendors); int result = search(user_query, vendors, total_vendors);
if(result > 0)
{
int item_amount;
char input[10];
read_input(input, 10);
if(atoi(input) < 0)
{
item_amount = atoi(input);
}
else
{
printf("You must enter a positive whole number for the number of items");
}
}
else
{
printf("No vendor in this market sells %s\n", user_query);
}
} }
fclose(fp); fclose(fp);
@ -185,6 +207,7 @@ int purchase(int item_id, int amount, struct vendor_item vendors[MAX_VENDORS])
if(amount <= vendors[item_id].inventory_count) if(amount <= vendors[item_id].inventory_count)
{ {
vendors[item_id].inventory_count = vendors[item_id].inventory_count - amount; vendors[item_id].inventory_count = vendors[item_id].inventory_count - amount;
return vendors[item_id].inventory_count; return vendors[item_id].inventory_count;
} }
else else