Concept - List, matrix problem

struct Panel {
    int ID;
    time_t StartTime;
    time_t EndTime;
    int LaneNo; // 1 or 2
    int SegmentNo; // 1 or 2
};

Let me know if you need any further help with this. We'll be happy to assist.

Thank you for your help. A few more questions.

Why do you use **struct **instead of class? Is it for memory reasons? Which is better? What exactly is the difference?

Could I do it as a matrix?

Panel CurrentPanel[2][2];

Now I always know which ID is in which segment. So without a queue.

Once the panel is finished, how can I delete it (from matrix)?

So is there a query similar to LinQ in C#? How would you implement that?

Like findif CurrentPanel[2][2].ID = 2;

Thanks for reaching out. The difference between strict and class is very minimal and primarily comes down to default member access and default inheritance access.

Struct: default member access is public. Default inheritance is public.

Class: member access is private. Default inheritance is private

No there is no difference in memory layout or performance between a struct and a class that have the same members. The choice is often a matter of convention:

·         Struct is typically used for simple data holding objects (like the Panel in your code) where all members should generally be public.

·         Class is typically used for more complex objects that encapsulate data and behavior often with a need for protected internal state (i.e., private members)

Using it as a Matrix/Array

Yes, you can absolutely do this.

Panel CurrentPanel[2][2]: declares a 2x2 array of Panel objects. This means you have a total of four panel objects, which you can access using indices, e.g., CurrentPanel[0][0], CurrentPanel[0][1], and CurrentPanel[1][1].

You can access members like this:

CurrentPanel[0][0].ID=5;

Deletion and Querying (like LinQ)

You cannot truly “delete” an element from a fixed-sized C-style array (like Panel CurrentPanel[2][2]). The memory for the array is allocated when the array is created and its size cannot change.

Instead of deletion, you would typically:

1.      Mark it as “deleted” or “free”. You could introduce a boolean isFree or similar flag in your panel struct or use a specific sentinel value for one of the fields (e.g., setID=-1 to indicate an unused slot).

2.      Overwrite it with a new panel when needed.

3.      Use a different container. For situations requiring dynamic insertion and deletion, you should use a dynamic container like sid::vector (for a dynamic list/array) or std::list (for quick insertion/deletion anywhere)

For your 2x2 structure, simply setting a sentinel value like ID = -1 is often the simplest approach for marking a slot as available.

C++ Equivalent of LinQ: Standard Library Algorithms

C++ doesn’t have a built-in language feature called LinQ, but it has a powerful set of tools in the Standard Library that provide similar functional programming capabilities, primarily in the <algorithm> and <numeric> headers.

The function you are looking for to “find if” an element exists is std::find_if

Hope you're doing well. Could you please let us know if the issue still persists or if it has been resolved? If everything is working fine now, we’d appreciate it if you could mark the response as answered. We’re planning to close the thread by 20 October, so we are hoping for your reply before that.