qn | Simple script to manage notes

I just made it in darpad, so it does not repeat all the widgets from your code, but does shuffle questions and options, and I think uses your model.

Only problem is that we need to change answer/answer_index too, as the list is shuffled, answer_index will not be correct, one very simple way is to do not use index for checking answer just use literal value of an answer(not an index).

Edited that too, which caused small change of your sample data's structure and small formal change of the model of Question

There are apparently (5 or) 6 cases of consecutive values, and the omnipresent default.

The jump table contains one address per case, and you will find these addresses in your listing.

For example, 0x00000000004005a1 is the address of this part:

I got it working with the help of Zwenn's old answer. Here is the solution I came up with after adapting his code.

I was able to solve the issue by installing the F# Compiler Tools using paket. The F# Compiler Tools for F# 4.5 runs on .NET Framework (or or mono) unlike F# 5 which runs on .NET Core (or .NET 5).

My Dockerfile doesn't look too much different from before. I still base it on the Microsoft .NET Framework SDK 4.8 image as I want access to the .NET SDK.

You can uninstall in powershell with this since it's an msi install (powershell 5.1):

You're taking all the steps necessary so if it's working it's fine though you could replace some of your forEach() loops with available methods:

with .flatMap()

Its quite simple really, and has nothing to do with ncurses:

You never rewind your file!

Your valid_file function reads all the data in your file, leaving nothing for the loop in main.

Since you never reset the file position after that function, the loop in main is never executed as there is nothing for readline left to read, and your program ends.

You must add fseek(stream, 0, SEEK_SET); to the end of valid_file just before return true.

Also note, that you never free the memory readline allocates for you, which you must do after each call, and also reset the line pointer to NULL and len to 0, to get it to allocate a new buffer.

Otherwise you will end up with a memory leak.
It may not be noticeable if your text file is small, but this is still a bad programming practice!

You are right that your first attempt to recurse through both trees in a single recursive function is difficult to do when the trees have different shapes: you may need to recur deeper in one tree, while in the other you are stuck at a leaf. This means you need to maintain lists to collect values (as can be seen in your code).

But storing values in lists is really defeating the purpose of the challenge. You might then as well collect all values in two lists and compare the lists, or collect the values of one tree in one list and compare against that list while making the traversal in the other (as is done in the video you linked to). Yet, it should not be necessary to use that much space for the job.

The idea to have two separate traversals going on in tandem is more promising. It becomes really easy when you make the traversal function a generator. This way that function stops running whenever the next value is found, giving you the opportunity to proceed in the other traversal also with one step.

Here is an inorder generator you could define in the Node class:

By default @SpringBootApplication does componentscan in its own folder and underneath. So just place ur ListToDoJavaFxApplication one folder up into pl.projektyjava.listToDoJavaFX

Alternatively just add @ComponentScan(“pl.projektyjava.listToDoJavaFX”) right above @SpringBootApplication defining component scan explicitly.

In general whenever auto wiring fails silently without BeanCreationException at startup it is a sign that ur component is not being found by component scan