1,199 karma · joined September 10, 2015
The cuboid embeds a 3d plot of each domain on each of it's side in order to plot the imaginary values as well.
The slicing allows you to select up to two frequencies from the frequency domain and plot the corresponding basis function on the top side of the cuboid. The top side of the cube corresponds to the 3d coordinate system in the gif.
In hope this helps to clarify.
For example shifting the signal along the time axis results in a linear phase twist in the spectral domain.
In most textbooks I came across the phase and magnitute are plotted separately and even in digital 3d plots often only one domain at a time is plotted.
Inspired by graphics like this [1] my idea was to plot both time and spectral domains at once onto the sides of a rotating cuboid. So each 90deg rotation of the cuboid represents one fourier transform (... -> s(t) -> S(f) -> s(-t) -> S(-f) -> ...).
[1]: https://mri-q.com/uploads/3/4/5/7/34572113/3311485_orig.gif
Like some basic SQL select/insert/update/create table/drop table syntax and semantics? In a way such that advanced/specific features are not available in order to not be relied on and then let all browsers just use sqlite as implementation detail?
The way nodes are created by clicking on an existing edge feels almost exactly as in my project and I remember how excited I was coming up with the idea on my own. But obviously this project predates my project by about 2 years.
Really nice work.
Simply stated the problem is: Viewing code as data (in a lisp sense) and transforming arbitrary data into a query that can be executed.
For example let user decide which columns to select, in which order to fetch the rows, which table to query etc. Or not even let the user decide but decide based on some config file or the system state.
You end up with a bunch of string manipulation that is fragile and does not compose well.
What solution is there except from simulating SQL via your languages nestable data structures?
But if nobody would import CSAM into their icloud library why do all the pictures need to be scanned in the first place? I would imagine anybody doing major illegal stuff being informed about important measures in order to not be caught.
There are other notations like small o(), Omega(), omega() or theta() to capture the asymtotic runtime behavior more or less precisely.
When clicking in in the menu bar to open a menu (for example on the apple logo) and then moving the mouse down, but diagonally in a way that the cursor cross the next to the right menu item (eg finder):
- in this demo the hover triggers the finder menu to open
- on a real map the diagonal down movement prevents that and keeps the current menu open
Area_triangle = Base_triangle * Height_triangle / 2
/edit: fixed factor of two
Or if you inverse the FK to make the user-table reference the shape tables you would need multiple potential nullable columns and a check constrain that exactly one is non-null. And it would still not solve the query side of things.
- simply allow tagged unions for foreign key constraints: CONSTRAINT my_fk FOREIGN KEY (own_column) REFERENCES EITHER table_a (a_id) OR table_b (b_id) OR table_c (c_id)
- add join syntax to join via defined foreign key: FROM own_table JOIN VIA my_fk
The union FK would store an additional flag determining the target table and the JOIN VIA would switch on that flag and it would be allowed to use any columns from all target tables in the query but only the matching ones would be not null.
I built something similar while learning for my algorithms course ate university. [0]
It not fully polished yet and not algorithms I had planned to implement are done yet. But I learned a lot doing it and some algorithms like "rotating calippers" or delaunay triangulation are really fun to watch.
Usage: click the canvas to create nodes, drag from their border to connect them. Click the "algorithms" tab on the top and select an algorithm to run in the right sidebar. The use the slider to step through the result.
OrigTableA = {(ruby, 5), (rust,7), (php, 3)}
OrigTableB = {(red, 5), (black, 7), (purple, 3)}
OrigTableA \cap OrigTableB would be empty, makes no sense
OrigTableA \cup OrigTableB would conain all 6 elements, would be a SQL UNION, makes no sense for join
OrigTableA \times OrigTableB would be the the cross product:
{ ((ruby, 5), (red, 5)), ((ruby, 5), (black, 7)), ((ruby, 5), (purple, 3)), ((rust,7), (red, 5)), ((rust,7), (black, 7)), ((rust,7), (purple, 3)), ((php, 3), (red, 5)), ((php, 3), (black, 7)), ((php, 3), (purple, 3)) }
Yes the cross product is what happens on a cross join (with the nested tuples being flattened) but now you have a single large set of all combinations and the filtering of only matching tuples (eg where the second element each tuple-pair matches) is simply not a binary operation on two sets but a unary operation on the single cross product set. Or if you tink of it as a binary pairing operation on the two original sets it is neither a set-union nor a set-intersection.
But when joining two tables the two base sets are of different type (containing tuples/rows of different length/element type) and the resulting set containes neither tuples from the one nor from the other original set but totally new concatinated tuples combined from the base sets.
It makes absolutely no sense and everytime I see an article explaining joins I just check if it contains those venn-diagrams and if so, just skip it.
It is the fully working safari UI in only 1000 lines of code. Additionally the declarative approach of SwiftUI together with the type system makes it certainly correct in many ways: no rendering bugs, no invalid states, probably no memory leaks, no cyclic dependencies creeping in.
Try to build this in Java Swing, UIKit, Html/Css/Js or any other UI library. Flutter might come close, react/vue/svelte as well, if you assume sensible predefined components. But they work similar to SwiftUI and the resulting one-file might look pretty similar.
[1]: https://ipfs.io/ipfs/QmcbGVA8nAYJN1pjXYHjUfrnAJAoCob1vxRvsAH...