stmctommyau/sba
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

stock fix,typo fix;

Browse Source 
reserve code for admin;
self salse system (in work);
This commit is contained in:
stmctommyau 2022-09-01 23:46:16 +08:00
parent 6e95628734
commit 1e5999a4e5
7 changed files with 322 additions and 55 deletions

2
.gitignore vendored

@ -1 +1,3 @@
main.exe
.VSCodeCounter/*
.vscode/*

30
admin_user.h

@ -13,10 +13,30 @@
#include "menu.h"
#endif //MENU_H
bool admin_menu(){
system("cls");
welcome_message();
// void admin_menu(){
// system("cls");
// welcome_message();
// //the selection menu
// // if(login valid)
// int choice = admin_menu_user_choices();
// switch (choice)
// {
// case 1://action with inventory
// inv_control();
// break;
// case 2://action with transction
// tran_control();
// break;
// case 3://action with user
// user_control();
// break;
// case 4://Exit
// break;
// default://invalid input ,should not happen,as it is already catch in above function
// printf("Invalid choice\n");
// break;
// }
return true;
}
// return true;
// }

8
data_file_inventory.txt

@ -1,31 +1,37 @@
#category, brand, product, price`vc , stock, barcode
#category, brand, product, price , stock, barcode
Test
Testing Co Ltd
Testing Product
15.0
0
1122
Juice
Mr Juicy
Orange Juice Drink 360mL (Bottle)
9.9
0
9665
Juice
F&N Fruit Tree
Apple & Aloe Vera Juice Drink 500mL
16.0
0
6479
Juice
F&N Fruit Tree
Apple & Aloe Vera Juice Drink 1L
22.9
0
5155
Juice
Homegrown Juice Company
Cold Pressed NZ Apple Juice 1L
35.5
0
6470
T2
T2 Brand
T2 Product
20.0
0
2983

2
database.h

@ -78,7 +78,6 @@ typedef enum {
//TODOLwrite function for these functions
//list of db func
int basic_get_row_count(int end, FILE *fp){
fseek(fp, 0, SEEK_SET);//prevent pointer on wrong position
@ -92,7 +91,6 @@ int basic_get_row_count(int end, FILE *fp){
continue;
}
colmun_count++;
puts(buffer);
if(colmun_count == end){
row_count++;
colmun_count = 0;

8
main.c

@ -35,16 +35,18 @@ int main(){
switch (choice)
{
case 1://admin
check = admin_menu();//refers to admin_user.h
//admin_menu();//refers to admin_user.h
check = true;
break;
case 2://normal user
check = normal_menu();//refers to normal_user.h
normal_menu();//refers to normal_user.h
check = true;
break;
case 3://exit
check = false;
break;
default://invalid input
printf("Invalid choice...press anykey to retry....\n");
printf("Invalid choice...press any key to retry....\n");
fflush(stdin);
getchar();
check = true;

325
normal_user.h

@ -22,37 +22,38 @@
//fucntions for menu
void list_items();
void search_item();
void self_help_sale_system();
void print_page(struct inventory db, int cur, int end,struct Map* map);
int normal_menu_user_choices();
//main of normal user
bool normal_menu(){
system("cls");
welcome_message();
//the selection menu
int choice = normal_menu_user_choices();
void normal_menu(){
int choice = 0;
do{
system("cls");
welcome_message();
//the selection menu
choice = normal_menu_user_choices();
switch (choice)
{
case 1://List items
list_items();
break;
case 2://Search item
search_item();
break;
case 3://scan barcode
// scan_barcode();
break;
case 4://Exit
return false;
break;
default://invalid input
printf("Invalid choice\n");
return false;
break;
}
return true;
switch (choice)
{
case 1://List items
list_items();
break;
case 2://Search item
search_item();
break;
case 3://self help sale system
self_help_sale_system();
break;
case 4://Exit
break;
default://invalid input ,should not happen,as it is already catch in above function
printf("Invalid choice\n");
break;
}
}while(choice != 4);
}
//universal functions for normal user
@ -72,10 +73,10 @@ void show_item(struct inventory db,int index){
}
int normal_menu_user_choices(){
int choice;
printf("You can buy items inside the 2 option below\n");
printf("Normal User Menu\n");
printf("1. List items\n");
printf("2. Search item\n");
printf("3. Scan Barcodes\n");
printf("3. Self help sale system\n");
printf("4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
@ -122,7 +123,7 @@ void list_page(struct inventory db,struct Map* map,int row){//user for showing l
if(choice <=8 && choice > 0){
printf("sorting...\n");
map = sortItems(db,choice);
}else if(choice == page_size+3){
}else if(choice == page_size+3 && page + 1 < total_pages){
page++;
}else if(choice == page_size+4 && page > 0){
page--;
@ -145,10 +146,10 @@ void print_page(struct inventory db, int cur, int end,struct Map* map){
for (int i = cur; i < end; i++)
{
if(map != NULL){
printf("%d item: %s\n", i + 9, db.row[map[i].key].product);
printf("%d item %d: %s\n", i + 9,i, db.row[map[i].key].product);
}
else{
printf("%d item: %s\n", i + 9, db.row[i].product);
printf("%d item %d: %s\n", i + 9,i, db.row[i].product);
}
}
}
@ -176,20 +177,21 @@ struct Map* sortItems(struct inventory db, int sort){
switch(sort){
case 1:
case 2:
map[i].value = (int)db.row[i].product;
map[i].value = (void*)db.row[i].product;
break;
case 3:
case 4:
map[i].value = (int)db.row[i].price*100;//presume there is no price contain 0.001
long price = db.row[i].price * 100;
map[i].value = (void*)price;//presume there is no price contain 0.001
break;
case 5:
case 6:
map[i].value = (int)db.row[i].brand;
map[i].value = (void*)db.row[i].brand;
break;
case 7:
case 8:
map[i].value = (int)db.row[i].category;
map[i].value = (void*)db.row[i].category;
break;
}
}
@ -212,11 +214,9 @@ struct Map* sortItems(struct inventory db, int sort){
//search items
char* prompt_search();
char* searchItems(struct inventory db, char* searchstr);
struct Map* searchItems(struct inventory db, char* searchstr);
void search_item(){
system("cls");
welcome_message();
@ -224,7 +224,6 @@ void search_item(){
//prompt user to select an item
//if user selects an item, display the item's details
struct inventory db = read_db_invt();
int total_pages = 0;
struct Map* map = NULL;
do{
@ -236,8 +235,9 @@ void search_item(){
welcome_message();
printf("0 exit\n");
printf("1 search\n");
printf("select your choice: ");
scanf("%d", &breakout);
fflush(stdin);
if(breakout == 1 || breakout == 0){
valid = true;
}else{
@ -250,7 +250,7 @@ void search_item(){
char* searchstr = prompt_search();
printf("searching...\n");
map = searchItems(db,searchstr);
if(map[0].value == 0){
if(map[0].value > 0){
list_page(db,map+1,map[0].value);//ofset map, as it is use to store the size
}else{//empty search
printf("No result found\n");
@ -271,13 +271,14 @@ char* prompt_search(){
return searchstr;
}
char* searchItems(struct inventory db, char* searchstr){
struct Map* searchItems(struct inventory db, char* searchstr){
struct Map* map = malloc(sizeof(struct Map) * (db.db.row_count+1));
int k = 1;
for (int i = 0; i < db.db.row_count; i++){
map[k].key = i;
if(strstr(db.row[i].product,searchstr) != NULL){
map[k].value = db.row[i].product;
map[k].value = (void*)db.row[i].product;
k++;
}
}
@ -286,3 +287,241 @@ char* searchItems(struct inventory db, char* searchstr){
return map;
}
//self help
typedef struct cart{//linked list
struct inventory_row* row;//pointer to the row
int quantity;//quantity of the item
struct cart* next;
};
int self_choice();
struct cart* scan_barcode(struct cart* cart,struct inventory db);
struct cart* list_cart(struct cart* cart);
void self_help_sale_system(){
system("cls");
welcome_message();
//scan barcode
struct inventory db = read_db_invt();
struct cart* cart = NULL;
bool check = false;
do{
//options
int breakout = 0;
int choice = self_choice();
switch (choice)
{
case 1:
cart = scan_barcode(cart,db);
check = true;
break;
case 2:
cart = list_cart(cart);
check = true;
default:
break;
}
}while(check);
}
int self_choice(){
int choice = 0;
bool valid = false;
do{
system("cls");
welcome_message();
printf("0 exit\n");
printf("1 scan barcode\n");
printf("2 cart\n");
printf("3 checkout\n");
printf("select an option: ");
scanf("%d", &choice);
if(choice <= 3 || choice >= 0){
valid = true;
}else{
printf("Invalid choice\n");
}
}while(!valid);
return choice;
}
//support for the linked list
struct cart* Cartappend(struct cart* cart,struct inventory_row* row,int quantity){
if(cart == NULL){
cart = malloc(sizeof(struct cart));
cart->row = row;
cart->quantity = quantity;
cart->next = NULL;
}else{
struct cart* temp = cart;
while(temp->next != NULL){
temp = temp->next;
}
temp->next = malloc(sizeof(struct cart));
temp->next->row = row;
temp->next->quantity = quantity;
temp->next->next = NULL;
}
return cart;
}
struct cart* Cartremove(struct cart* cart,int index){
if (cart == NULL){
return cart;
}else{
struct cart* temp = cart;
if (index == 0){
cart = cart->next;
free(temp);
return cart;
}else{
for (int i = 0; i < index-1; i++){
temp = temp->next;
}
struct cart* new = temp->next->next;
free(temp->next);
temp->next = new;
return cart;
}
}
}
struct cart* Cartupdate(struct cart* cart,int index,int quantity){
if (cart == NULL){
return cart;
}else{
struct cart* temp = cart;
if (index == 0){
cart->quantity = quantity;
return cart;
}else{
for (int i = 0; i < index-1; i++){
temp = temp->next;
}
temp->next->quantity = quantity;
return cart;
}
}
}
//scan barcode
struct inventory_row* find_barcode(struct inventory db,long barcode);
long prompt_barcode();
struct cart* scan_barcode(struct cart* cart,struct inventory db){
long barcode = prompt_barcode();
printf("matching...\n");
struct inventory_row* row = find_barcode(db,barcode);
if(row != NULL){
printf("product: %s\n",row->product);
printf("price: %.2f\n",row->price);
printf("Enter quantity: ");\
int quantity = 0;
scanf("%d", &quantity);
if(quantity > 0){
cart = Cartappend(cart,row,quantity);
}else{//empty search
printf("Unable to match or invalid input\n");
}
}while(true);//break on top
return cart;
}
long prompt_barcode(){
printf("Please scan the qr code(or input the barcode ) ");
long barcode;
scanf("%ld", barcode);
return barcode;
}
struct inventory_row* find_barcode(struct inventory db,long barcode){
struct inventory_row row;
printf("s");
for (int i = 0; i < db.db.row_count; i++){
printf("s");
printf("%ld\n",db.row[i].barcode);
if(db.row[i].barcode == barcode){
return &db.row[i];
}
}
return (struct inventory_row*)NULL;
}
//list cart
struct cart* cart_control(struct cart* cart,int index);
struct cart* list_cart(struct cart* cart){
int choice = 0;
do{
system("cls");
welcome_message();
double total_price = 0;
int i=1;
printf("0 exit\n");
if(cart == NULL){
printf("Cart is empty\n");
}else{
struct cart* temp = cart;
while(temp != NULL){
int qty = temp->quantity;
double price = temp->row->price * qty;
total_price += price;
printf("%d product:%s price:$%lf qty:%d\n",i,temp->row->product,price,qty);
temp = temp->next;
i++;
}
printf("Total price: $%.2f\n",total_price);
}
do{
printf("input the corrisponding value for more action\n");
scanf("%d", &choice);
if(choice >0 && choice <= i){
cart = cart_control(cart,choice);
}
}while(choice >0 && choice < i);
}while(choice != 0);
return cart;
}
struct cart* update_cart(struct cart* cart,int index);
struct cart* cart_control(struct cart* cart,int index){
int choice = 0;
do{
system("cls");
welcome_message();
printf("0 exit\n");
printf("1 remove\n");
printf("2 edit quantity\n");
bool check = false;
do{
scanf("%d", &choice);
if(choice == 1){
cart = Cartremove(cart,index-1);
check = true;
}else if(choice == 2){
cart = update_cart(cart,index);
check = true;
}else if(choice != 0){
printf("Invalid choice\n");
check = false;
}
}while(!check);
}while(choice != 0);
return cart;
}
struct cart* update_cart(struct cart* cart,int index){
system("cls");
welcome_message();
printf("enter the new quantity: ");
int quantity = 0;
scanf("%d", &quantity);
if(quantity > 0){
cart = Cartupdate(cart,index-1,quantity);
}else if (quantity == 0){
cart = Cartremove(cart,index-1);
}else{
printf("Invalid quantity\n");
}
return cart;
}

2
sorting.h

@ -1,6 +1,6 @@
typedef struct Map{
int key;
int value;
void* value;
};
int compare_decending(const void *a, const void *b){