They really should make a Windows-native installer if they want it to run on Windows. BONUS: make it installable / updatable through NuGet & Chocolatey.
#Crystal is sort of like a compiled version of #Ruby.
A quick guide to choosing the right #Ruby interpreter for your project.
I’m not familiar with #TopTal, but I don’t see a date on the article, so there is no way to know whether its advice is outdated. 0/10 would not use the site’s content except as background research.
@mangeurdenuage I don't remember #Firefox taking a psrticulsrly long time to compile, but #Chromium did seem to take a while. Nothing compares to the week I once spent waiting for #Ruby to compile on a box with a really slow Celeron, 128MiB of RAM.
For todays #FollowFriday I'm going to do something a bit different. We have a lot of new users, one of the biggest surges we have seen in a while. As such a lot of new users are looking for high quality, long-standing, accounts to follow. Similarly many of the new users need some help getting attention and making new friends.
As such I am going to do this #FF in a few parts. One for old users I have mentioned in previous posts, as well as some of the new users who have been making quality posts and been active for at least a week now. Hopefully this will be more helpful.
Also a section for some bots might be useful.
I will use a persons profile description here as I dont want to misrepresent anyone.
:awesome_slide_r: New Mentions :awesome_slide_l:
@design_RG - Books, Bicycles & Cats, Life is Good. Books, #hardcover. Bikes, #Classic sport ones. Cats, any colour or size. #Aquarius with Virgo rising. House of Ravenclaw.
@Karthikdeva - Always a Student, Nano-Technologist, Bookworm?, and basically I don't know anything, so I might be asking some agonizing questions.
@_lunawinters - Just a human , living on a rock called Earth, floating in a giant space.
@Full_marx - I am a मस्त डॉन on Mastadon. I wish to build something that can be of good use to as many people as possible. Social Sciences: Propaganda Science, Social Engineering, Behavioural Science, Advertising STEM: Human-Computer Interaction Design, Web Dev, Cyber Security Noob. Multimedia: Motion Graphics, Video Production, Electronic Music Production, Abstract Film, Writing Politics: Left, Right and Center. Whichever ideology leaves the people with the most amount of Dignity, sign me up for that one.
@raining_night - I love women, food, thriller/sci-fi/slasher movies and series, astro physics, superbikes, nature and animals ❤️ not in any specific order Trying out Veganism.
@ppmanik - Believe in free speech and data privacy. Interested in physics and science in general and future of Semiconductors and related devices in particular.
@chris - Developer focusing on #WordPress, #Privacy and the #OpenWeb. Also a speaker, teacher, blogger, and pilot doing my best to make the world a better place.
@SecondJon - I'm interested in being just not civil, but excellent in interacting with others of different viewpoints in an online world where we can so viciously defend our echo chambers and be so dismissive of other perspectives. I rarely log onto the bird site of FB anymore because the interactions are unproductive about anything meaningful. I'm a #Dad, #Husband, #Christian, #Anglican, Unaffiliated #conservatarian, Software #Developer, #Coloradan, Reader of paper #books, Card and BoardGamer, #tea drinker, solving problems for co-workers and partners primarily with and integrating with the #Salesforce/SFDC platform.
@metapsyche - I am a cloud of vapor. Fragmenting into ever smaller pieces to explore ever widening spaces. Web Developer by day, Pattern Hunter at night. Thinker and Tinkerer on weekends. :)
@imvectech - RESEARCH ° COOPERATE ° MONITOR ° ADAPT. Developing and teaching to implement DITO techniques for human survival between knowledge and fate.
@david - Value people over code. I manage tech.lgbt. WordPress Maintenance fixupfox.com. On the Internet, everyone knows I'm a dog. Follows are open both ways for me if you're nice and cool!
This was a really fun programming challenge originally proposed by @Absinthe I want to paste it here, along with my solution, so everyone who is interested can check it out.
If i made this into a Radix Trie by compressing nodes with single children down I could reduce this further.
But since it does work I thought I'd share it as is. I'll update everyone if i decide to finish optimizing this particular solution.
It does however do a fairly decent job at compressing the tree by making sure no subtree is a duplicate of any other part of the tree (a node of any specific length/id will be the only node with that length.
For clarity I attached a picture from my notes of what the Trie would look like for the encoded string "12345" where the value inside each circle/node is the "length" value of that node, and the value attached to an arrow/vector/edge is the "chunk" associated with that link. The end result is any path from the minimum node (0) to the maximum node (5). This diagram does not include incomplete paths which my program does right now.
Incomplete paths can also be trimmed to further reduce the space. But since incomplete paths each add only a single leaf node to the tree, and might be useful for various use cases I decided to keep it.
If i made this into a Radix Trie by compressing nodes with single children down I could reduce this further.
But since it does work I thought I'd share it as is. I'll update everyone if i decide to finish optimizing this particular solution.
It does however do a fairly decent job at compressing the tree by making sure no subtree is a duplicate of any other part of the tree (a node of any specific length/id will be the only node with that length.
For clarity I attached a picture from my notes of what the Trie would look like for the encoded string "12345" where the value inside each circle/node is the "length" value of that node, and the value attached to an arrow/vector/edge is the "chunk" associated with that link. The end result is any path from the minimum node (0) to the maximum node (5). This diagram does not include incomplete paths which my program does right now.
Incomplete paths can also be trimmed to further reduce the space. But since incomplete paths each add only a single leaf node to the tree, and might be useful for various use cases I decided to keep it.
If i made this into a Radix Trie by compressing nodes with single children down I could reduce this further.
I also need to improve the display function as it does breadth first not depth first thus breaks the optimization right now.
But since it does work I thought I'd share it as is. I'll update everyone if i decide to finish optimizing this particular solution.
It does however do a fairly decent job at compressing the tree by making sure no subtree is a duplicate of any other part of the tree (a node of any specific length/id will be the only node with that length.
For clarity I attached a picture from my notes of what the Trie would look like for the encoded string "12345" where the value inside each circle/node is the "length" value of that node, and the value attached to an arrow/vector/edge is the "chunk" associated with that link. The end result is any path from the minimum node (0) to the maximum node (5). This diagram does not include incomplete paths which my program does right now.