Assignment: Tiny Savings and Loan

Due: Thursday, August 16th, 8pm

In this assignment you will handle the transactions for Tiny Savings and Loan, a small bank that saves and loans money out to customers. The bank tellers generate a stream of inputs like the following

Alice joins trusted
Alice deposits 100
Bob joins untrusted
Bob deposits 300
Alice withdraws 50
Alice withdraws 100
Bob withdraws 100
Charlie joins trusted
Alice prints
Bob prints
Charlie prints

You will take this stream of inputs, maintain the balance of each customer and ensure that they do not withdraw too much money.

In order to do this you will have to write a lookup-table. You will then use that lookup table to build the banking application.

Lookup Table/Associative Array

It will be easy to build the banking application if we have the right data structure. In this assignment you will first build a lookup table to store the accounts by name. A lookup table has the following header

Table mkTable();

bool contains(Table t, char *key); // Does the table contain this key?
ValueType get(Table t, char *key); // Get the account associated to key
Table set(Table t, char *key, ValueType value); // Sets the key to new value. Adds new key/value pair if necessary. Returns pointer to table.
int size(Table t); // How many elements are in the table?
void printTable(Table t); // Nicely print the table

A lookup table is a collection of key-value pairs. We can insert a new key-value pair with set and, given any key, we can easly retrieve the value.’ In this case we will use the customer’s name as the key and their full account as the value.

Examples: This is, for example, how a phone book works. In a phone book the keys are names and the values are phone numbers. You supply a name and get back a phone number. Normal arrays work this way too. You supply an index/int and get back a value. Lookup tables are like arrays that are indexed with non-int keys.

Implementation

Internally a lookup table is a collection of key/value pairs. This collection must be able to grow. We will implement a lookup table with a linked list of nodes. Each node will contain both a char *key and an Account value as well as the necessary fields to link to the other nodes.

Your lookup table code should know nothing about Accounts. In fact you should write your lookup table with the return type ValueType. You can typedef any type to ValueType at compile-time. For testing we suggest that you typedef

typedef int ValueType;

So that your lookup table maps strings to ints. This will make it easy to write tests (you won’t have to make accounts to test your lookup table). When you move to the next section you can typedef Accounts to ValueType and your code should work just the same. This is because lookup.c doesn’t actually need to know anything about the values that it stores. It will just need to find and return them.

typedef Account ValueType;

Testing

Unit testing each function in your lookup table in this case may be annoying because each test will necessarily require the use of several functions (e.g. you will have to set many times to test size). Feel free to just have one or two large tests.

Tiny Savings and Loan

Now that we have a lookup table writing this application should be much easier. We strongly recommend that you don’t start writing this part of the homework until you are confident that your lookup table works very well.

The input stream from Tiny Savings and Loan works can have the actions
joins, deposits, withdraws, prints. In each case the action is preceded by the name of the account holder and optionally followed by some extra information (such as a balance). These actions have the following rules.

If a withdrawal transaction fails your program should print a short fail message.

Transaction for Name fails

Handling inputs

The main function that we provide will take inputs from the command line and open up a pointer to a file FILE* inputFile. You can call the function

char *nextMessage(FILE* inputStream)

with the input file as an input to obtain the next line in the file. You can call this function many times. Each time you call it it will return the next line in the file. When there are no more lines in the file it will return NULL

We have given you code to handle command line arguments from the user. As it is set up now this program has two modes. If you give it a text file as a command line input

./tsl.exe input.txt

It will read lines from that file.

If you do not supply an argument

./tsl.exe

It will expect you type in lines by hand at the terminal. This can be useful for testing. Of course, if you forget about this you will wonder why your program isn’t doing anything. It’s waiting for you. You can signifiy end-of-input by pressing Ctrl-D or just stop the program by Ctrl-C

Program Flow

You should create an input file stream (this is done for you), create a lookup table for the accounts, and then read in and handle messages one at a time affecting the account book at each step.

You should do this until the file runs out. nextMessage will return NULL when it reaches the end of the file.

Example Input/Output

Input:

Alice joins trusted
Alice deposits 100
Alice print
Bob joins untrusted
Bob deposits 300
Bob print

Alice withdraws 10
Alice withdraws 10
Alice print
Bob withdraws 250
Bob print

Alice withdraws 100
Alice print
Bob withdraws 200
Bob print

Output:

Alice:      $ 100
Bob:        $ 300
Alice:      $  80
Bob:        $  50
Alice:      $ -20
Transaction for Bob fails
Bob:        $  50

Submission

You should submit at least the following files

If you write more files please remember to both add them to your repository

svn add filename.c

and check them in. Remember that you can check the status of your repository through the web interface. This is useful to ensure that all the necessary files have been uploaded.