By chance, do you happen to know if the Mindstorms NXT (the old one, before EV3) software was based on the same toolkit? I always wondered what UI framework it used, it had an unusual look.
It was not... it actually was, IIRC, a LabVIEW program with some tweaks here and there. The UI was basically a LabVIEW VI front panel with a LabVIEW 2D Picture Control. Most of the program logic and the compiler to the NXT was LabVIEW G code.
Very short answer: because a treesitter will do an approximately correct parsing, while a hand written parser will do a correct parsing (and if not, it is a bug).
About 90 millions rods vs 6 millions cones. Sometimes I'm surprised we can even see detail at all. Though it certainly helps that they're not uniformly distributed; most cones are in the macula, around the middle of the back of the eye. Still, it's not a lot.
And within the macula, the red and green are generally towards the centre and the blue are generally towards the edge. This helps prevent the red shift problem photographs with high contrast changes sometimes get.
There is a very real risk of political candidates committing political fraud, getting elected thanks to it, and putting pressure on the judiciary branch to lower their chances of getting arrested. We're seeing this exact process happen in real time in the US. Every modern country pretends that nobody is above the law and that bad people will get convicted and get sentences but in real life the government has power over this stuff.
Making ineligibility sentences immediate is a way to make sure this sort of thing doesn't happen.
It's also a way for someone to make their own re-election (or the continued control of their party) easier by "putting pressure on the judiciary branch" as you said to find their opponent guilty.
Take the individual parties of today out of it. You don't want the party in power in the government to have the ability to decide who is allowed to run for office. If you actually want to live in a democracy and not just autocracy with your favored party in power, you want the people to decide who runs with as little government input as possible.
A judge saying someone is not allowed to run for office is objectively, by definition, anti-democratic.
> We're seeing this exact process happen in real time in the US.
Last I checked Rosie O'Donnell is only one stupid enough to imply that the latest presidential election was not completely above board.
I know that, I'm just saying that if you can "put pressure on the judiciary" (which is a ridiculous statement in most western countries but especially France) to find someone not guilty, you can certainly do it to find them guilty.
The information the jury hears in the US in criminal cases, especially high profile ones, is extremely tightly controlled. They're not in the room when lawyers are making evidentiary arguments to include or exclude evidence. I've served on a couple juries and the most high-stakes one carried potentially decades of jail time for the defendant. We were shuffled in and out of that room dozens of times each day for lawyers to make arguments about what we could or could not hear. Several of our questions during deliberation were answered with a section of the transcript and nothing more.
> But the animation actually shows that after step 2, Q = [a1, a3, b1, b3]. In other words, a3 didn't join the back of the queue but jumped in front of b1. This is what leads to the buggy behavior that is shown.
This is my fault. The animation doesn't really point that out, but these are two separate queues: the forwards BFS and the backwards BFS each have their own queue. What the diagram shows is the order in which the nodes will be visited, according to the queues. So it's interleaved, in a way, since each step alternates the BFS that is executed.
However, suppose that Q actually be a "normal" queue. We'd then need to track, in the queue, which "way" the node should be visited (forwards or backwards). We'd be visiting more nodes at once per side but we'd still not visit levels at once before moving on to the other side, so it could still give the bad path sometimes. Also, since we'd only have one queue, we would be unable to efficiently detect a missing path: right now we check at each step if either of the queues is empty (and stop if that's the case). With a single queue, it would be slow to check if one side doesn't have any queued nodes, and without that check, for cases where no path exists, we'd waste time expanding a search on one side when it could never reach the destination anyway.
Very nice. Modern GPUs really are fast as drawing points.
It's pretty similar to a project I've been working on for the past year, scraping Facebook instead of BlueSky (which is a bit harder since FB doesn't expose an API for that). I currently have about 140 million nodes on my scraped graph and a GUI with pathfinding and stuff like that.
It's a shame though because as nice as the thing is, I'm not sure I can publish it online, given it contains names of people. I don't think the GDPR would be very happy.
Which is why I'm a bit surprised you published this, aren't you afraid of people, uh, disliking the fact that they're present in your dataset?
One would hope the people on bluesky understand that they're posting publically to a centralized database. What data privacy problem are you concerned with?
As I understand it, the moment you're processing someone's personally identifiable information, you're in the red zone, GDPR-wise. The users consented to publish their info on BlueSky, but not on OP's website.
I get the idea behind the GDPR and it's nice to protect consumers but I'm scared for hobby projects like this.
I think GDPR itself is a bit unclear here. Google Search still operates in Europe as far as I know even though it scrapes and indexes people's websites without explicit consent, and I suspect GDPR doesn't intend to make it illegal to do this. Could be wrong...
IANAL but at least in the U.S. I'm pretty sure publicly-available data is generally excluded from whatever protections do exist on PII. I'm not sure what, if anything, has been said about this in the EU.
> The Civil Rights movement succeeded because it was guided by leaders who had clear, specific, and realistic goals, and were able to negotiate to achieve them. Since neotoddlers “organize” mostly on social media [...]
The author somehow skips the part where Civil Rights activists were criticized for the exact same reason in their time (i.e. disrupting the daily life of people).
There are many points to make about methods of protest, but this is just not a good analysis piece.
Yeah, that quote is just objectively false, and exemplifies Dr. King's words about white moderates in Letter from a Birmingham Jail:
“…that the Negro’s great stumbling block in his stride toward freedom is not the White Citizen’s Councilor or the Ku Klux Klanner, but the white moderate, who is more devoted to ‘order’ than to justice; who prefers a negative peace which is the absence of tension to a positive peace which is the presence of justice; who constantly says: ‘I agree with you in the goal you seek, but I cannot agree with your methods of direct action’; who paternalistically believes he can set the timetable for another man’s freedom; who lives by a mythical concept of time and who constantly advises the Negro to wait for a ‘more convenient season.’ ”
That does not make all civil disobedience well considered or justified. But it's important to recall that we delay and delay and delay justice, and then waggle our fingers when people realize that if justice were really to be given by talking politely it would have already happened.
I had this question a few years back while working on a social network graph project and trying to render a multi-million node graph. Tried Ogma and it worked quite well but it became too slow when approaching the million. Ended up writing my own renderer in C++ and then Rust. Code here: https://github.com/zdimension/graphrust
Tested it up to 5M nodes, renders above 60fps on my laptop's iGPU and on my Pixel 7 Pro. Turns out, drawing lots of points using shaders is fast.
Though like everybody else here said you probably don't want to draw that many nodes. Create a lower LoD version of the graph and render it instead
