C-language | C语言练习代码 | Learning library

You're using dev.onyxstudios.cca, whatever that might be, and it is using reflection to get at a field named type of some unspecified class.

It is either trying to get at the field named type of one of JDK's own classes, in which case the fix is to uninstall whatever JDK you installed and install AdoptOpenJDK11: You're on a too-new version of java and these most recent versions have been breaking apps left and right by disabling aspects of the reflective API.

Or, it is trying to get to a field named type in one of the classes of the FABRIC project, perhaps, whatever that might be, based on the content of this error message. In which case, the problem is a version incompatibility between these two plugins. Look up the project pages of these 2 plugins and install 2 versions whose release dates are close together. This usually involves downgrading the more recently updated one.

If you read a few lines above, they're describing how the namespaces are separated.

This example shows a typedef of type char named FlagType and a variable in myproc() of type int named FlagType.

This is stupid, and nobody should do it, but it is legal from a language parsing standpoint.

I had the same "WTF‽" reaction when I first learned of nested anonymous structures.

\e is escape and what that printf() line is telling the terminal to move the cursor to line 1 column 1 (\e[1;1H) and to move all the text currently in the terminal to the scrollback buffer (\e[2J).

These are ANSI escape codes and here's some resources:
https://gist.github.com/fnky/458719343aabd01cfb17a3a4f7296797
https://bluesock.org/~willkg/dev/ansi.html
https://en.wikipedia.org/wiki/ANSI_escape_code (suggested by tadman)

Edit: I also recommend the use of \e[H\e[2J\e[3J as that is what cls/clear prints. This tells the terminal to move the cursor to the top left corner (\e[H), clear the screen (\e[2J), and clear the scrollback buffer (\e[3J).

I think you're doing your math wrong:

To search from the table, you should check each elements of the table using a loop.

Also note that you should use == operator, not = operator, for comparision.

I've implemented serialization for dynamic_bitset before: How to serialize boost::dynamic_bitset?

You can use that or a similar technique based on the same interfaces:

C 2018 6.10.6 discusses the #pragma directive. Paragraph 1 says:

… causes the implementation to behave in an implementation-defined manner. The behavior might cause translation to fail or cause the translator or the resulting program to behave in a non-conforming manner…

That largely licenses the implementation to do anything it wants, as long as it documents it. If #pragma warning( disable : 34 ) is documented to disable the warning, and that is what it does, then that is conforming.

Note in particular that the #pragma “might … cause the translator … to behave in a non-conforming manner.” So, doing something that is otherwise non-conforming because a pragma told you to is conforming.

(I think the original text should say that the #pragma may cause the translator or program to behave in an otherwise non-conforming manner. Because, as currently written, behaving in this documented non-conforming manner is conforming, not non-conforming.)

1000 0000 which is equal to -0...

Ones' complement has a -0, but most computers use two's complement which does not.

In two's complement notation the left-most bit represents -(coefficient_bit * 2^N-1) i.e. in your case, 1000 0000 the left-most bit represents -(1 * 2^8-1) which is equal to -128 and that's why the output is the same.

Your char is an 8 bit signed integer in which case 1000 0000 is -128. We can test what 1000 0000 is conveniently using the GNU extension which allows binary constants.

The same identical configuration works today, I guess some changes were done on the GitHub side.