Legend: 0%
100%Mean logprob: -0.44864544262060246 (63.85%)
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 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)
{
//printf("head is NULL\n");
return EXIT_FAILURE;
}
sprintf(str, "%d * %s @ $%0.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;
if (head == NULL) {
return EXIT_FAILURE;
}
node *curr = head;
char str[MAX_ITEM_PRINT_LEN];
while (curr!= NULL) {
list_item_to_string(curr, str);
printf("%d: %s\n", i, str);
i++;
curr = curr->next;
}
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
node *prev = *head;
if (pos == 1){
node *new_node = malloc(sizeof(node));
new_node->item_name = item_name;
new_node->price = price;
new_node->quantity = quantity;
new_node->next = *head;
*head = new_node;
return EXIT_SUCCESS;
}
while (prev!= NULL && pos!= 2){
pos--;
prev = prev->next;
}
if (prev == NULL){
return EXIT_FAILURE;
}
node *new_node = malloc(sizeof(node));
new_node->item_name = item_name;
new_node->price = price;
new_node->quantity = quantity;
new_node->next = prev->next;
prev->next = new_node;
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) {
// TODO: Implement this function,
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
node *curr = *head;
if (pos == 1){
curr->item_name = item_name;
curr->price = price;
curr->quantity = quantity;
return EXIT_SUCCESS;
}
while (curr!= NULL && pos!= 1){
curr = curr->next;
pos--;
}
if (curr == NULL){
return EXIT_FAILURE;
}
curr->item_name = item_name;
curr->price = price;
curr->quantity = quantity;
return EXIT_SUCCESS;
}
// remove the item at position pos
int list_remove_item_at_pos(node **head, int pos) {
// TODO: Implement this
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
node *temp, *prev;
if (pos == 1){
temp = *head;
*head = temp->next;
temp = NULL;
return EXIT_SUCCESS;
}else if(pos > 1){
temp = *head;
prev = NULL;
while (pos>1){
if (temp == NULL){
return EXIT_FAILURE;
}
pos--;
prev = temp;
temp = temp->next;
}
prev->next = temp->next;
temp = NULL;
return EXIT_SUCCESS;
}
return EXIT_FAILURE;
}
int list_swap_item_positions(node **head, int pos1, int pos2) {
// TODO: Implement this
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
if (pos1 == pos2){
return EXIT_SUCCESS;
}
node *curr1 = *head;
node *curr2 = *head;
node *prev1 = NULL;
node *prev2 = NULL;
while(curr1!= NULL && curr2!= NULL){
if (pos1 == 1){
break;
}
prev1 = curr1;
curr1 = curr1->next;
if (pos2 == 1){
break;
}
prev2 = curr2;
curr2 = curr2->next;
pos1--;
pos2--;
}
if (curr1 == NULL || curr2 == NULL){
return EXIT_FAILURE;
}
if (prev1!= NULL){
prev1->next = curr2;
}
else{
*head = curr2;
}
if (prev2!= NULL){
prev2->next = curr1;
}
else{
*head = curr1;
}
node *tmp = curr1->next;
curr1->next = curr2->next;
curr2->next = tmp;
return EXIT_SUCCESS;
}
// calculate the total cost of the list (sum of all prices * quantity)
int list_cost_sum(node *head, float *total){
// TODO: Implement this
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
node *curr = head;
float sum = 0;
while (curr!= NULL){
sum += curr->price * curr->quantity;
curr = curr->next;
}
*total = sum;
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
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
if (head == NULL) {
return EXIT_FAILURE;
}
*pos = 1;
int i = 1;
node *curr = head;
float highest = curr->price;
while (curr!= NULL) {
if (curr->price > highest) {
highest = curr->price;
*pos = i;
}
i++;
curr = curr->next;
}
return EXIT_SUCCESS;
}
// 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 new line at the end
int list_save(node *head, char *filename) {
// TODO: Implement this {
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
FILE *fp;
fp = fopen(filename, "w");
if (fp == NULL) {
printf("Error opening file!\n");
return EXIT_FAILURE;
}
node *curr = head;
while (curr!= NULL) {
fprintf(fp, "%s,%.2f,%d\n", curr->item_name, curr->price, curr->quantity);
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 new line at the end
// the loaded values are added to the end of the list
int list_load(node **head, char *filename) {
// TODO: Implement this
// return EXIT_SUCCESS or EXIT_FAILURE when appropriate
int pos = 1;
while(*head!=NULL){
pos++;
*head = (*head)->next;
}
FILE *fp = fopen(filename, "r");
if (fp == NULL) {
return EXIT_FAILURE;
}
char *item_name = (char *) malloc(sizeof(char)*256);
float price;
int quantity;
while (fscanf(fp, "%s,%f,%d\n", item_name, &price, &quantity)!= EOF){
list_add_item_at_pos(&(*head), item_name, price, quantity, pos);
pos++;
}
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 ordder
int list_deduplicate (node **head) {
// TODO: Implement this function
// return EXIT_SUCCESS or EXIT FAILURE when appropriate
// node *temp, *prev, *curr;
// prev = NULL;
// curr = *head;
// temp = curr->next;
// while(temp!= NULL){
// if(strcmp(curr->item_name,temp->item_name) == 0){
// curr->quantity = curr->quantity + temp->quantity;
// prev->next = temp->next;
// free(temp);
// temp = prev->next;
// }else{
// prev = curr;
// curr = curr->next;
// temp = curr->next;
// }
// }
return EXIT_SUCCESS;
}