Lattice | A collection of Behaviors for iOS that 'll allow for slim | iOS library

I am just trying to learn to draw 3d objects with pyopengl. The first thing I am trying to draw is the following code. The coordinates posat, i.e. the positon of atom is supposed to be a bcc lattice, but I am far from getting anything like a cube. The output is added. Kindly let me know what I am doing wring here:

This is the link to the pdf file from which I want to extract data

Is there any way to configure the iCE40 Ultra Plus 5k PLL without using the fancy propietary tools like Lattice Icecube2 / Radiant software.

Official PLL programming guide (source) only shows how to use mentioned propietary GUI tools (ch. 4)

A list of points with x and y coordinates form a square lattice, how do I know to which row and column of each lattice each point corresponds?

To take an easy example, I would start with a dataframe like this.

Setting aside all the concerns about the necessity of using typeid and dynamic_cast and their questionable effects on code maintenance, is there any information about the performance of these two dynamic type introspection mechanisms? The Wikipedia article on RTTI claims that:

The use of typeid, in a non-polymorphic context, is often preferred over dynamic_cast in situations where just the class information is needed, because typeid is always a constant-time procedure, whereas dynamic_cast may need to traverse the class derivation lattice of its argument at runtime.

However no citation is provided. As such I wanted to ask if this claim is true and if one of these two mechanisms should definitely be preferred performance-wise over the other. I wasn't able to find information about any bounds on time complexity of these operations.

I am trying to create a plot with dual y-axes using the xyplot and doubleYscale functions of latticeExtra. How do I change the axis label colors of the left and right y-axis as well as legend line colors to the same as the line colors in the plot? These now plot in blue and pink, but should be same as the lines in the plot below. Please see reproducible code example and plot below:

I am attempting to create a 3d quiver plot of velocity vectors, using 3 arrays containing the vectors in x, y, z space with respect to time. I.e. a video of the quiver plot. Can someone help with this? I have showed the error message below from running the code as it is.

For example one frame of the output should look a bit like this:

Main code: part 1 and part 2. Also here:

(Note this code was successfully used for the 2D version now being upgraded to 3D)

Here's a program that I am trying to run for Potts Model. It gives the plot once and then keeps repeating the line

I am trying to build a lattice-type of FCA-type of data structure in Haskell where I could check if two entities have a join or not. Actually, I'm not even sure that the lattice is the right structure as it might be a bit "too much".

Here is the context. In a COBOL program analyzer, I have an ontology of data set names, files, records and fields. A data set name can have multiple file names depending on the program, a file can have multiple records and a record can have multiple fields. I'd like this hierarchy to be reflected in the Haskell data structure. But I'd like also to be able to have a relation inherited for file1 and file2 such that I can check if file1 and file2 belong to the same data set name. Actually, this relation could almost be that of "==". But it could simply be that they do have a join in dsn0, for instance.

I have other ontologies in that context that would benefit from a lattice or FCA data structure. For example, I have programs that belongs to job steps and job steps that belong to jobs. If I could easily figure out if two programs belong to the same job, that would be great. Here also, it seems like a "join" operator. Getting the extension (code) of a certain entity would be useful too.

I'm still a bit new to Haskell. I tried to look at the Lattice library but I'm not sure where to go from there, concretely. Any idea of how to get started? A small example of a lattice in Haskell would be very helpful. Thank you very much for your help (and patience).

UPDATE: The Lattice might not be the best formalism for this as mentioned in the comments. I realize I might just have to use a regular class type of data structure along those lines: