There's any way to get item count of a table?

[E_Blue]

I have the following tables
Both tables should have the same item count.

[Ttelmah]

You can't.
C doesn't offer any way to find the number of items in a table. Only Sizeof.
If you declare a define for the number of elements per row, then
sizeof/ELEMENTS, will give the number of rows.

[Jerson]

There is a popular macro called Nelements(x)

and is

#define Nelements(x) sizeof(x)/sizeof(x[0])

This will tell you the number of elements in an array

Hope that helps

[E_Blue]

Thanks for your answer.
So I suppose then that I must be careful and count them by myself.
_________________
Electric Blue

[E_Blue]

[Ttelmah]

That only works for things like floats, int32's etc., where the elements have
a 'size'. So you get the number of elements by dividing the size of the
entire array, by the size of one element.
Problem here is that an array of 'strings', is just an array of characters....

[Ttelmah]

As a comment, you could use this solution, if you typedef a single
dimensional character array large enough for the line elements, and then
make the final array an array of these elements, instead of a 2D character
array.

[Jerson]

I beg to disagree here. An array of "pointer to string" has a fixed size for each of its members that point to individual strings. Therefore, the number of elements can be determined accurately. I use it in my projects to determine the number of elements in a menu.

[Ttelmah]

A lot depends on how recent his compiler is.

Historically, 'const' didn't support pointers. So a const array as is shown here
was constructed internally as a 2D char array, not an array of pointers.
However if he is using a modern compiler, this can be built as an array
of pointers, so the size of each element will be the size of a pointer, and
the trick being suggested, will then work.
This is why telling us what compiler version is involved is always
necessary....

[Jerson]

Ok. I concede your explanation may be related to version.

[temtronic]

OK, maybe I'm looking at this wrong, but if the data is always some 'text', could you just read , test every element using 'isalpha(x)' and count them ?
Then compare the two counts and if not equal, do 'something' ?

I know this would not be fast for large tables but it 'works fine' in my head....
Jay

[E_Blue]

@temtronic
The two tables are related, is like a dictionary.
I search the text in the first table and if there any coincidence I use the same index to get the text of the second table; so both tables must have the same item count.

Each item in the first table always have the same length.
The second table does not; each element have a variable length of characters.

Time to time I must to edit add some new codes and / or delete some others; So I want some kind of warning / error to let me know that I made a mistake.
_________________
Electric Blue

[Ttelmah]

So long as you have a modern compiler, the test outlined should work.

However you are asking about doing it with the preprocessor. No.