doctest | fastest feature-rich C11/14/17/20

im trying to use pyinstaller to convert this python file to a exe file, but whenever i try to do this i get an error in the output. Im using cmd with the auto-py-to-exe command and ive been trying to figure out what this error means but i cannot understand a thing about what is going on.

If anyone knows how to fix this, please help. Everything shown is the information I know.

Here is my code:

Is there a way to remove the green highlighting in the doctest in PyCharm?

Or am I doing something wrong in the first place? And that is the reason why the code is highlighted?

I am working on an end-of-year project for my university CS course, but I have been stuck at this one function for several days, I haven't been able to get much help, and my time is starting to run out. Can you please help me fixing this?

The function definition in hpp contains a constructor:

In Rust 2018 I can use extern self as crate_name and then use fully-qualified syntax, for example

I have a project for school and I want to write a Makefile, I have seen some examples of using Makefile with multiple source directories and multiple executables but still could not implement it properly to my Makefile.

PS: I'm using doctest for the unit testing (and I can't change it).

Here is the project structure (and I can't change it):

So I manually installed a locally downloaded python package by going into the folder directory and using the cmd command:

python setup.py install

After that it just installed itself normally. Using the python function help("modules") in cmd also confirmed that it was installed correctly as I can see the name being given out. The two modules are called binance_d and binance_f

I'm writing a Discord bot that will accept user input as a string and then evaluate the expression inside it, nothing fancy just simple arithmetic operations. I have two concerns - safety and decimals. First I used simpleeval package, it worked fine but it had trouble with decimals, e.g 0.1 + 0.1 + 0.1 - 0.3 would return 5.551115123125783e-17. After googling a lot I found an answer that work's but it uses the built in eval() function and apparently using it is a big no.

Is there a better/safer way of handling this? This implements https://docs.python.org/3/library/tokenize.html#examples decistmt() method which substitutes Decimals for floats in a string of statements. But in the end I use eval() and with all those checks I'm still unsure if it's safe and I'd rather avoid it.

This is what decistmt() does:

I have a python module some_module with an __init__.py file that imports methods, like this:

Code newbie here, and I am creating a project in Python.

I have a class called ExpressionTree which is, an N-ary expression tree, such that each node is not merely restricted to having only two children; it can have more than 2, but not less than 2.

The class's private variables are: _root which is Optional[Union[str, int]] and _subtrees which is List[ExpressionTree]. I have successfully implemented basic methods such as __eq__, is_empty, evaluate_tree, __str__, and append, but I am stuck permanently on one single method.

The only operators I would use in this tree are "+" and "-" (but the code should work for any operator).

All leaves are either a single letter string, or an integer, and all parents are either "+" or "-". Also, all leaves are ExpressionTrees but with an empty list for self._subtrees.

The method I am trying to create is called create_tree, which takes in a list called lst, for which the type is: List[List[Union[int, str]]], and returns a successfully created ExpressionTree that was made from the parameter: lst.

Each list in lst represents a level, but for each operator in the list, the next lists are the children of each operator. For example, if lst = [[+], [+, +], [1, 2], [3, 4]], then the Tree should look something like:

Tree 1

On a more nested example, if I were to run create_tree([[+], [3, +, +], [5, *], [b, c], [6, a]]), the Tree I should be getting is:

Tree 2

I know that a Queue would be very useful, but I do not know where to start. I don't think this code necessarily would need recursion, but it could work with it as well if implemented correctly.

I wish not to use any imports or create new classes, except List.

The doctest I have are something like this: