make a new entry in C

Code:

---

struct pqueue
{
    int numEntries;
    struct entry entries[10];         
    }
pqueue;
 
case 'e':
void enqueue(struct pqueue*pqueue, struct entry entry)
        {
    if (pqueue->numEntries == 10)
    {
        printf("priority queue already full!");
        return;
    }
    else
...

---

i try to make a priorityqueue and after the else there should follow a code where i create a new entry and obviously numentries should increase by 1 and if it worked well a text should be displayed "a new entry has successfully been added"
how do i do this?

How do you plan to implement the priority queue?

What do you exactly mean by that? I tryna make a enqueue, a dequeue, print queue and exit. and output should look something like that

Choose action: print queue (p), enqueue entry (e), dequeue entry (d) or exit (x): e

Choose priority: lowest (L), low (l), normal (n), high (h), highest (H): a

Input invalid! Try again: L

Choose message: Do_something!

Maybe you could pick a better font colour scheme.

Choose action: print queue (p), enqueue entry (e), dequeue entry (d) or exit (x): e

Choose priority: lowest (L), low (l), normal (n), high (h), highest (H): a

Input invalid! Try again: L

Choose message: Do_something!

So does your 'struct entry' have a member called priority, which can take values represented by "lowest (L), low (l), normal (n), high (h), highest (H)" ?

More to the point, you've only shown the user interface.
The real meat of the problem is how implement the priority queue, of which there is very little to go on.

For example, if your queue has just one 'n' entry, and you try to add a 'H' entry, do you know how to do that?

i have problems with understand these things. yes my struct entry does have a member called priority. and no i dont know how to do that.
probably something like =

Code:

---

struct entry getNewEntry(){
        struct entry newEntry;
        newEntry.prio = 'H';
        newEntry.message = "msg1";
        return newEntry;
}

---

do you have discord so i could ask some questions if you are not busy right now? Alan-FH#6689

Quote:

---

Originally Posted by awox

do you have discord so i could ask some questions if you are not busy right now? Alan-FH#6689

---

Just ask right here...

Quote:

---

Originally Posted by ghoul

Just ask right here...

---

already did i dont know how to make enqueue an entry for the priorityqueue

One way perhaps

Code:

---

struct pqueue
{
    int numEntries[5];
    struct entry entries[5][10];         
    }
pqueue;

---

Adding an entry is simply adding to the right queue, where H=0, h=1, n=2 etc.

If you just have the one queue, then you have to search all the entries to find out where the newEntry.prio should go, by comparing with all the pqueue.entries[i].prio.

Was your previous homework just 'queue'?
Because if you haven't managed to understand and implement a regular queue to begin with, then priority queue is just an unnecessarily large jump from your current experience.

Quote:

---

Originally Posted by Salem

One way perhaps

Code:

---

struct pqueue
{
    int numEntries[5];
    struct entry entries[5][10];         
    }
pqueue;

---

Adding an entry is simply adding to the right queue, where H=0, h=1, n=2 etc.

If you just have the one queue, then you have to search all the entries to find out where the newEntry.prio should go, by comparing with all the pqueue.entries[i].prio.

Was your previous homework just 'queue'?
Because if you haven't managed to understand and implement a regular queue to begin with, then priority queue is just an unnecessarily large jump from your current experience.

---

It do be like that for us: We learn Structs, Enums, Pointers, whatsoever. and then we get a massive homework where everything is mixed up crazy, then you lose overview for everything. Thats where I am at right now.


the numEntries should be there to track the number of entries? it should be max 10. so doesnt i have to be numentries[10]? if i use an int array. is it better to use an array or just the int variable?


struct pqueue{
int numEntries;
struct entry entries[10];
}pqueue;

this is what the entry should contain:

struct entry{
char message[32];
priority priority;
}entry;



Data Structure - Priority Queue

tried something like this but ehh dont understand the steps at all

It's all there in PriorityQueueDemo.c

Focus on what this is doing.
// if data is larger, shift existing item to right end

Quote:

---

Originally Posted by Salem

It's all there in PriorityQueueDemo.c

Focus on what this is doing.
// if data is larger, shift existing item to right end

---

in this priorityqueuedemo.c "entry" is my "data"?

Quote:

---

Originally Posted by awox

in this priorityqueuedemo.c "entry" is my "data"?

---

Yes.
All you need is some way to compare one entry with another.

You need to be able to do this with entries.
if(data > intArray[i])