Legend: 0%
100%Mean logprob: -0.45862185916117665 (63.22%)
Legend: 0%100%
#include <stdio.h>
#include <stdlib.h>
#include <getopt.h>
#include <limits.h>
#include <string.h>
#include "list.h"
#ifdef UNIT_TESTING
/* Redirect printf to a function in the test application so it's possible to
* test the standard output. You can ignore this; it's not relevant to the
* assignment. */
#ifdef printf
#undef printf
#endif /* printf */
extern int test_printf(const char *format,...);
#define printf test_printf
#endif
#define MAX_ITEM_PRINT_LEN 100
// Note: All list_ functions should return a status code
// EXIT_FAILURE or EXIT_SUCCESS to indicate whether the operation was
// successful or not.
// create a new list
int list_init(node **head)
{
*head = NULL;
return EXIT_SUCCESS;
}
// print a single list item to an externally allocated string
// This should be in the format of:
// "quantity * item_name @ $price ea", where item_name is a string and
// price is a float formatted with 2 decimal places.
int list_item_to_string(node *head, char *str) {
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
if(head == NULL)
return EXIT_FAILURE;
sprintf(str, "%d * %s @ $%.2f ea", head->quantity, head->item_name, head->price);
return EXIT_SUCCESS;
}
// print the list to stdout
// This should be in the format of:
// "pos: quantity * item_name @ $price ea", where
// pos is the position of the item in the list,
// item_name is the item_name of the item and
// price is the float price of the item formatted with 2 decimal places.
// For example:
// """1: 3 * banana @ $1.00 ea
// 2: 2 * orange @ $2.00 ea
// 3: 4 * apple @ $3.00 ea
// """
// It should return a newline character at the end of each item.
// It should not have a leading newline character.
int list_print(node *head) {
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
int i = 1;
while (head!= NULL) {
// char str[MAX_ITEM_PRINT_LEN] = {0};
// list_item_to_string(head, str);
printf("%d: %d * %s @ $%.2f ea\n", i, head->quantity, head->item_name, head->price);
i++;
head = head->next;
}
return EXIT_SUCCESS;
}
// add a new item to the list
int list_add(node **head, int quantity, char *item_name, float price) {
node* cur;
for (cur = *head; cur; cur = cur->next) {}
node* new = (node*) malloc(sizeof(node));
new->quantity = quantity;
strcpy(new->item_name, item_name);
// new->item_name = item_name;
new->price = price;
new->next = NULL;
if (cur == NULL) {
*head = new;
}
else {
cur->next = new;
}
return EXIT_SUCCESS;
}
// add a new item (name, price, quantity) to the list at position pos,
// such that the added item is the item at position pos
// For example:
// If the list is:
// 1: 3 * banana @ $1.00 ea
// 2: 2 * orange @ $2.00 ea
// and you call list_add_item_at_pos(&head, "apple", 3.0, 4, 2)
// the list should be:
// 1: 3 * banana @ $1.00 ea
// 2: 4 * apple @ $3.00 ea
// 3: 2 * orange @ $2.00 ea
int list_add_item_at_pos(node **head, char *item_name, float price, int quantity, unsigned int pos)
{
node *item = malloc(sizeof(node));
if (item == NULL) {
return EXIT_FAILURE;
}
item->item_name = item_name;
item->price = price;
item->quantity = quantity;
item->next = NULL;
if (*head == NULL) {
*head = item;
return EXIT_SUCCESS;
}
node *cur = *head;
for (int i = 0; i < pos - 1; i++) {
if (cur->next == NULL) {
return EXIT_FAILURE;
}
cur = cur->next;
}
item->next = cur->next;
cur->next = item;
return EXIT_SUCCESS;
}
// update the item at position pos
int list_update_item_at_pos(node **head, char *item_name, float price, int quantity, unsigned int pos) {
if (*head == NULL) {
return EXIT_FAILURE;
}
node *cur = *head;
for (unsigned int i = 0; i < pos - 1; i++) {
if (cur->next == NULL) {
return EXIT_FAILURE;
}
cur = cur->next;
}
cur->item_name = item_name;
cur->price = price;
cur->quantity = quantity;
return EXIT_SUCCESS;
}
// remove the item at position pos
int list_remove_item_at_pos(node **head, int pos)
{
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
if (*head == NULL)
return EXIT_FAILURE;
node *cur = *head;
if (cur == NULL)
return EXIT_FAILURE;
if (pos == 0) {
*head = cur->next;
free(cur);
return EXIT_SUCCESS;
}
for (int i = 0; i < pos - 1; i++) {
if (cur->next == NULL)
return EXIT_FAILURE;
cur = cur->next;
}
return EXIT_FAILURE;
}
// swap the item at position pos1 with the item at position pos2
int list_swap_item_positions(node **head, int pos1, int pos2) {
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
if (*head == NULL)
return EXIT_FAILURE;
node *cur = *head;
if (pos1 == pos2)
return EXIT_SUCCESS;
if (pos1 < pos2) {
for (int i = 0; i < pos1 - 1; i++) {
if (cur->next == NULL)
return EXIT_FAILURE;
cur = cur->next;
}
for (int i = 0; i < pos2 - pos1 - 1; i++) {
if (cur->next == NULL)
return EXIT_FAILURE;
cur = cur->next;
}
} else {
for (int i = 0; i < pos2 - 1; i++) {
if (cur->next == NULL)
return EXIT_FAILURE;
cur = cur->next;
}
for (int i = 0; i < pos1 - pos2 - 1; i++) {
if (cur->next == NULL)
return EXIT_FAILURE;
cur = cur->next;
}
}
node *temp = cur->next;
cur->next = temp->next;
temp->next = cur;
if (pos2 == 0) {
*head = temp;
} else {
node *prev = *head;
for (int i = 0; i < pos2 - 1; i++) {
if (prev->next == NULL)
return EXIT_FAILURE;
prev = prev->next;
}
prev->next = temp;
}
return EXIT_SUCCESS;
}
// remove the first item with the given item_name
int list_remove_item_with_name(node **head, char *item_name) {
int pos = 0;
for (node* cur = *head; cur; cur = cur->next) {
if (strcmp(cur->item_name, item_name) == 0) {
list_remove_item_at_pos(head, pos);
return EXIT_SUCCESS;
}
++pos;
}
return EXIT_FAILURE;
}
// save the list to file filename
// the file should be in the following format:
// item_name,price,quantity\n
// (one item per line, separated by commas, and newline at the end)
int list_save(node *head, char *filename)
{
FILE* fptr = fopen(filename, "w");
if (fptr == NULL) {
return EXIT_FAILURE;
}
for (; head; head = head->next) {
fprintf(fptr, "%s,%f,%d",head->item_name, head->price, head->quantity);
}
fclose(fptr);
return EXIT_SUCCESS;
}
// load the list from file filename
// the file should be in the following format:
// item_name,price,quantity\n
// (one item per line, separated by commas, and newline at the end)
// the loaded values are added to the end of the list
int list_load(node **head, char *filename)
{
FILE* fptr = fopen(filename, "r");
if (fptr == NULL) {
return EXIT_FAILURE;
}
int* quantity;
char* item_name;
float* price;
while (fscanf(fptr, "%s,%f,%d\n", item_name, price, quantity) > 0) {
list_add(head, *quantity,item_name, *price);
}
fclose(fptr);
return EXIT_SUCCESS;
}
// de-duplicate the list by combining items with the same name
// by adding their quantities
// The order of the returned list is undefined and may be in any order
int list_deduplicate(node **head)
{
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
int dup = 1;
while (dup) {
dup = 0;
for (node* cur = *head; cur; cur = cur->next) {
char* name1 = cur->item_name;
int pos;
for (node* cur2 = cur->next; cur2; cur2 = cur2->next) {
pos = 1;
if (cur2->item_name == name1) {
dup = 1;
cur->quantity += cur2->quantity;
list_remove_item_at_pos(&cur, pos);
}
++pos;
}
}
}
return EXIT_SUCCESS;
}
// find the item position with the highest single price
int list_find_highest_price_item_position(node *head, int *pos)
{
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
int hightest_price = INT_MIN;
for (node* cur = head; cur; cur = cur->next) {
if (cur->price > hightest_price) {
cur->price = hightest_price;
}
++*pos;
}
return EXIT_SUCCESS;
}
// calculate the total cost of the list (sum of all prices * quantities)
int list_cost_sum(node *head, float *total)
{
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
*total = 0;
for (node* cur = head; cur; cur = cur->next) {
*total += cur->price * cur->quantity;
}
return EXIT_SUCCESS;
}