Legend: 0%
100%Mean logprob: -0.5054555976796001 (60.32%)
Legend: 0%100%
#include <stdio.h>
#include <stdlib.h>
#include <getopt.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 return a status code EXIT_FAILURE or EXIT_SUCCESS
// to indicate whether the operation was successful or not.
// Members of the node struct:
// char* item_name, float price, int quantity, node *next
// create a new list
int list_init(node **head) {
// create a new list
if (!(*head = (node *)malloc(sizeof(node)))) {
printf("[ERROR] malloc failed\n");
return EXIT_FAILURE;
}
(*head)->next = 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) {
// check if no list
if (!head) {
printf("[ERROR] list is empty\n");
return EXIT_FAILURE;
}
// check if head is NULL
if (!head->item_name ||!head->price ||!head->quantity) {
printf("[ERROR] invalid node\n");
return EXIT_FAILURE;
}
// generate string
sprintf(str, "%d * %s @ $%.2f ea", head->quantity, head->item_name, head->price);
str[MAX_ITEM_PRINT_LEN] = 0;
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) {
// check if no list
if (!head) {
printf("[ERROR] list is empty\n");
return EXIT_FAILURE;
}
// iterate through list and print to stdout
int i = 1;
node *curr = head;
while (curr) {
char str[MAX_ITEM_PRINT_LEN];
list_item_to_string(curr, str);
printf("%d: %s\n", i, str);
curr = curr->next;
i++;
}
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) {
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
return EXIT_FAILURE;
}
// update the item at position pos
int list_update_item_at_pos(node **head, char *item_name, float price, int quantity, unsigned int pos) {
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
return EXIT_FAILURE;
}
// 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
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
return EXIT_FAILURE;
}
// 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
return EXIT_FAILURE;
}
// 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
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 *fp = fopen(filename, "w");
if (!fp) {
printf("[ERROR] cannot open file %s\n", filename);
return EXIT_FAILURE;
}
node *curr = head;
while (curr) {
// generate string
char str[MAX_ITEM_PRINT_LEN];
list_item_to_string(curr, str);
fprintf(fp, "%s\n", str);
curr = curr->next;
}
fclose(fp);
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 *fp = fopen(filename, "r");
if (!fp) {
printf("[ERROR] cannot open file %s\n", filename);
return EXIT_FAILURE;
}
char str[MAX_ITEM_PRINT_LEN];
node *curr = *head;
while (fgets(str, MAX_ITEM_PRINT_LEN, fp)) {
// get item name
char *item_name = strtok(str, ",");
// get price
char *price = strtok(NULL, ",");
// get quantity
char *quantity = strtok(NULL, ",");
// skip newline
char *newline = strtok(NULL, "\n");
// create new node
if (!(curr = (node *)malloc(sizeof(node)))) {
printf("[ERROR] malloc failed\n");
fclose(fp);
return EXIT_FAILURE;
}
curr->next = NULL;
curr->item_name = strdup(item_name);
curr->price = strtof(price, NULL);
curr->quantity = atoi(quantity);
// add to end
if (*head == NULL) {
*head = curr;
} else {
node *tmp = *head;
while (tmp->next) {
tmp = tmp->next;
}
tmp->next = curr;
}
}
fclose(fp);
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
return EXIT_FAILURE;
}