Again, you pass in a pointer to the queue structure, but this time you pass in the address where you want the integer to be stored. Then, taking an element from the head of the queue. Then, adding something to the end of the queue is the put on queue, and you just pass it in as an integer and you give it the pointer to the queue structure. Then, it takes two other integers, one for an indication of whether or not you're creating or deleting a queue, and then another if you're creating it for the size. When the function returns, that pointer will have the address of the queue structure. So you'll pass in a pointer and then, that will come back. It takes as an argument the address of a pointer to the queue to double pointer. The first is qmanage, which manages the creating and deleting queues basically. In that file also on the next slide, it shows the prototypes for the functions. As I said, all of this is called the Queue Structure. Then, size is the maximum number of elements that can go into the queue. But the beginning of the queue is the element at the index number contained in head. So if it goes to the end, the one after the end is at the beginning of the array. We also have the index in that array of the first element in the queue, which is the head and the number of elements in the queue, which is the count. We have a pointer to an array of queue elements and the elements are all integers. On the next slide, in queue.h, we see the actual queue structure. Then, queue.c is simply the set of library functions that would be compiled and put into a library, and then linked into the program at the appropriate time. Queue.h that contains the data structures and the constants, and it defines the type queue. In this library which is called from programs, there are two files. So, don't worry about picking on someone else. Now, why are we doing it this way instead of just telling you the problems? Because it's always fun to pick apart someone's code and the instructor wrote this. It's going to be written in the C programming language in the way that most C programmers would normally write it. In this module, in the next slide, what we're going to do is look at a library that implements a queue: last in, first out.

Tor project fragile code with rust