k4rtik

If faster compile cycles are one of your primary requirements, you might like to try Hugo.

I recently learned how modern IDE's provide the kind of features Rust LS is targeting. For anyone else interested, here is a great video explaining the same: https://channel9.msdn.com/Blogs/Seth-Juarez/Anders-Hejlsberg...

Is it inflating the results shown on Wi-Fi?

I am on a MacBook Air Early 2014 and my current link speed is 144 Mbit/s according to Network Utility, but fast.com shows between 210 to 230 Mbps on each run.

Speedtest.net results are consistent as before at ~38 Mpbs, which is what I would expect from the routers around me.

User for >4 years. Absolutely love the nifty little tool. But I hated opening up a terminal each time I wanted to initiate a download.

For PopClip[1] users on Mac, I made a little YouTube-dl extension[2] which lets you initiate the download just by selecting the video URL (best when done from browser's address bar) and clicking a button. Been using it as my primary ytdl client for past 5 months now.

[1]: https://pilotmoon.com/popclip/

[2]: https://github.com/k4rtik/popclip-ytdl

Non-paywalled link: http://queue.acm.org/detail.cfm?id=2891413

Sorry, I did not realize (being within a university network) that the link I submitted was under a paywall.

Served as Macros 101 for me (apart from C macros, that is). Thanks Nick.

Late to the party, but this looks interesting.

Google does something similar for extracting favicons for any domain, such as https://plus.google.com/_/favicon?domain=github.com

Anybody noticed ‏an istx25 stalking each tweet-job suggestion and ultimately getting busted[1]? :D

[1]: https://twitter.com/markmcerqueira/status/608914346706657280

> It doesn't matter what value is returned by a read that overlaps a write. The algorithm is correct even if reading a number while it is changing from 9 to 10 obtains the value 2496.

There are two variables involved in the bakery algorithm[1] -- choosing[k] and number[k]:

- choosing[k] takes only the two values 0 & 1, hence reading/writing to it is atomic.

- number[k] is boundless, hence the question of inconsistency while reading it. Lamport shows (see Assertion 2's Proof in [1]) that given,

  1. tL2 < tL3 (on process i), and
  2. te < tw < tc (on process k),

(in the non-trivial case) tc can only occur before tL2 (tc < tL2) => tw < tL3, that is process i reads the current value of number[k]. See, no overlap! "The bakery algorithm is correct as long as reading a number returns the correct value if the number is not concurrently being written".

I think it is much easier to understand with the two-arrow formalism presented later in the article.

[1]: http://msr-waypoint.com/en-us/um/people/lamport/pubs/bakery....

One of my professors, Prof. Vineeth K Paleri, at NIT Calicut (http://cse.nitc.ac.in) asks the students to read this article by Djikstra in their first class with him. Was an interesting read indeed.

> (and for that matter, it appears, from Amazon) Amazon has put an upper limit of 50K on Cash on Delivery.

> We have some outdated courses, we don't have the freedom to choose courses, etc.

I disagree. I have just finished (few weeks back) my BTech from an NIT and can at least vouch for my CS education and those from some other respectable NITs. We had a great amount of freedom in choosing the courses and had some of the best faculty to learn from.

Generalizing the education in India to this extent certainly paints a wrong picture. I agree that there are only a few institutes which are good, but they are surely not limited to just IITs and IISc.

This was published weeks back in The Hindu: http://www.thehindu.com/features/education/college-and-unive...

Adding links really is a huge pain in the Compose window now.