archived stringclasses 2 values | author stringlengths 3 20 | author_fullname stringlengths 4 12 ⌀ | body stringlengths 0 22.5k | comment_type stringclasses 1 value | controversiality stringclasses 2 values | created_utc stringlengths 10 10 | edited stringlengths 4 12 | gilded stringclasses 7 values | id stringlengths 1 7 | link_id stringlengths 7 10 | locked stringclasses 2 values | name stringlengths 4 10 ⌀ | parent_id stringlengths 5 10 | permalink stringlengths 41 91 ⌀ | retrieved_on stringlengths 10 10 ⌀ | score stringlengths 1 4 | subreddit_id stringclasses 1 value | subreddit_name_prefixed stringclasses 1 value | subreddit_type stringclasses 1 value | total_awards_received stringclasses 19 values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | alex_w | null | Many smaller amounts of slower (by a few ms) spread over the day, vs. either your ISP replacing an NXDOMAIN with an ad, or just straight failing and never responding every so often.
The trade off is up to you but I've used my own recursive resolver since ISDN was hot shit. | null | 0 | 1491126705 | False | 0 | dfq26qs | t3_62vx64 | null | null | t1_dfq21zm | null | 1493724932 | 7 | t5_2fwo | null | null | null |
null | stesch | null | We used these 8 questions: http://stackoverflow.com/a/117891/41860
But replaced number 8 with a simple palindrome test. Everything in PHP at home. 1 1/2 hours to solve it. Everything allowed incl. Google search.
Most applicants had severe problems. PHP has ready to use functions for some of these questions and even this wasn't easy enough.
This experience made me realize that civilization will die within the next 10 years because of some silly software bug.
| null | 0 | 1491126743 | False | 0 | dfq2744 | t3_62xwba | null | null | t3_62xwba | null | 1493724937 | 26 | t5_2fwo | null | null | null |
null | lampshadish2 | null | Thank you for updating it and thank you for the credit. | null | 0 | 1491126956 | False | 0 | dfq2939 | t3_62szbn | null | null | t1_dfpzykb | null | 1493724963 | 3 | t5_2fwo | null | null | null |
null | samboskull | null | Wrong, and I'm guessing you've never read Martin Fowler's other stuff? | null | 0 | 1491127215 | False | 0 | dfq2bhw | t3_62ul90 | null | null | t1_dfpvnsw | null | 1493724995 | 2 | t5_2fwo | null | null | null |
null | PaintItPurple | null | JWT doesn't get around the problem. With just JWT, you lack invalidation. In order to solve this problem, you need to keep track of sessions on the server, and now we're back to square one. | null | 0 | 1491127275 | False | 0 | dfq2c3i | t3_62ul90 | null | null | t1_dfq1u2q | null | 1493725003 | 4 | t5_2fwo | null | null | null |
null | matthieum | null | > But Rust has no stable support for architectures other than x86 meaning that people are actively supporting the Intel/AMD vendor lockin.
*For those who have looked up [Rust Platform support](https://forge.rust-lang.org/platform-support.html):*
- *Tier I: Guaranteed to build and pass the test suite*
- *Tier II: Guaranteed to build*
- *Tier III: No Guarantee*
It's easy to criticize this, the problem however is one of hardware. To run the test suite on a given platform, one needs a machine setup for Travis/Appveyor for said platform. This costs money.
If you are interested in moving a platform to Tier I, you (or more realistically, your organization) is encouraged to maintain a build server on said platform.
If no organization is willing to do so; then one can only conclude that no organization cares that much about the other platforms. Sad, maybe, but pragmatic. | null | 0 | 1491127284 | False | 0 | dfq2c73 | t3_62wye0 | null | null | t1_dfq1fa1 | null | 1493725004 | 38 | t5_2fwo | null | null | null |
null | gnx76 | null | What is funny is that he posted a message describing the buffer overflow he claimed to have found in 65 seconds, and then quickly deleted it. The description was nice and all, but its first line was wrong, that was not what the program was doing, so everything was wrong and there was no actual buffer overflow. It's cool that he found out by himself, but he didn't retract his original claim that he found a buffer overflow in 65 seconds :-) | null | 0 | 1491127711 | False | 0 | dfq2g7m | t3_62wye0 | null | null | t1_dfq1yow | null | 1493725058 | 6 | t5_2fwo | null | null | null |
null | jonhanson | null | [Goodhart's Law](https://en.wikipedia.org/wiki/Goodhart%27s_law) applies equally well
to interview questions, albeit slightly reformulated:
> As soon as a measure of programming ability becomes an interview question it ceases to be a good measure of ability. | null | 0 | 1491127881 | 1491129992 | 0 | dfq2hur | t3_62xwba | null | null | t3_62xwba | null | 1493725080 | 17 | t5_2fwo | null | null | null |
null | peterfirefly | null | But you could make a fine satellite with a normal Intel 486:
A Danish satellite, Ørsted, has been in orbit for 18 years now and it is still running just fine. It uses a 486 for the star tracker.
https://en.wikipedia.org/wiki/%C3%98rsted_(satellite)
https://en.wikipedia.org/wiki/Star_tracker
An article (in Danish) about the choice of the 486 written a few years before launch:
https://ing.dk/artikel/orsted-og-486eren-11473
| null | 0 | 1491127948 | False | 0 | dfq2ij7 | t3_62sqe6 | null | null | t1_dfpd7gz | null | 1493725090 | 2 | t5_2fwo | null | null | null |
null | colonwqbang | null | Note my choice of words "on the surface". | null | 0 | 1491128257 | False | 0 | dfq2lks | t3_62scvv | null | null | t1_dfpwmwm | null | 1493725130 | 2 | t5_2fwo | null | null | null |
null | samboskull | null | ITT lots of holier than thou attitude and referring to people as idiots.
I personally found the article helpful, I didn't learn anything new however I believe this is a great explanation of how easy it is to crack weak secrets and the consequences of it.
I've worked with a lot of devs who don't know this kind of stuff, mostly because they've never had to work at a scale where someone would try and crack your session token, and thus they've never felt the need to learn nor had to.
Y'all need to lighten up and see the good in the world. | null | 0 | 1491128438 | False | 0 | dfq2n9q | t3_62ul90 | null | null | t3_62ul90 | null | 1493725152 | 8 | t5_2fwo | null | null | null |
null | tty14 | null | one of my fav audio codecs | null | 0 | 1491128467 | False | 0 | dfq2njc | t3_62ys2x | null | null | t1_dfq248x | null | 1493725155 | 1 | t5_2fwo | null | null | null |
null | ggtsu_00 | null | Python's GIL is a non-issue if you write actual asynchronous code and use asynchronous libraries. Node.js is actually way worse in this regards because node runs in a single CPU thread. Try writing something with a dense long for-loop, and your entire node server will hang and not response to any requests. With Python, if you run a big heavy forloop, while the GIL will not allow it to run parallel code, at least the server can continue to response to network requests in other threads since the interpreter allows threaded context switching.
It is far easier to migrate a threaded Python app to async Python as many libraries exist that wrap existing libraries, and async Python performs way better than anything you can do with Node. | null | 0 | 1491128600 | False | 0 | dfq2orc | t3_62wvfa | null | null | t1_dfpolab | null | 1493725172 | 5 | t5_2fwo | null | null | null |
null | LawBot2016 | null | The parent mentioned [**Goodhart's Law**](http://legaliq.com/Definition/Goodhart_S_Law). For anyone unfamiliar with this term, **here is the definition:**^\(In ^beta, ^be ^kind)
****
Goodhart's law is named after economist Charles Goodhart, paraphrasing: "When a measure becomes a target, it ceases to be a good measure."
The original formulation by Goodhart is this: "As soon as the government attempts to regulate any particular set of financial assets, these become unreliable as indicators of economic trends." This is because investors try to anticipate what the effect of the regulation will be, and invest so as to benefit from it. Goodhart first used it in a 1975 paper, and it later became used popularly to criticize the ... [[View More](http://legaliq.com/Definition/Goodhart_S_Law)]
****
^(**See also:**) [^Monetary ^Policy](http://legaliq.com/Definition/Monetary_Policy) ^| [^Variable](http://legaliq.com/Definition/Variable) ^| [^Charles](http://legaliq.com/Definition/Charles) ^| [^Stability](http://legaliq.com/Definition/Stability) ^| [^Rational](http://legaliq.com/Definition/Rational) ^| [^Invest](http://legaliq.com/Definition/Invest)
^(**Note**: The parent poster ) ^\(jonhanson ^or ^geek\_007) ^can [^delete ^this ^post](/message/compose?to=LawBot2016&subject=Deletion+Request&message=cmd%3A+delete+reply+t1_dfq2hur) ^| [^**FAQ**](http://legaliq.com/reddit) | null | 0 | 1491128896 | False | 0 | dfq2rh7 | t3_62xwba | null | null | t1_dfq2hur | null | 1493725208 | 11 | t5_2fwo | null | null | null |
null | RAKtheUndead | null | And the hilarious thing is that avionics software is starting to move to C++ because it's too difficult to find Ada programmers. Because everybody decided to stereotype Ada as a boring language, while they fap persistently about Rust instead. | null | 1 | 1491129177 | False | 0 | dfq2u4n | t3_62wye0 | null | null | t1_dfq18v8 | null | 1493725244 | -1 | t5_2fwo | null | null | null |
null | SikhGamer | null | Holy crap, posts like this just shine a light on how much I don't know.
Thanks for sharing. | null | 0 | 1491129206 | False | 0 | dfq2ufq | t3_62vx64 | null | null | t3_62vx64 | null | 1493725248 | 3 | t5_2fwo | null | null | null |
null | Radmonger | null | Different poster, presumably different buffer overflow. | null | 0 | 1491129446 | False | 0 | dfq2wru | t3_62wye0 | null | null | t1_dfq2g7m | null | 1493725279 | 3 | t5_2fwo | null | null | null |
null | 0b_0101_001_1010 | null | > Enums are that plus the size of a tag.
This is not always the case, for example, [`std::mem::size_of::<Option<Vec<T>>>() == std::mem::size_of::<Vec<T>>()`](https://play.rust-lang.org/) ;) | null | 0 | 1491129447 | 1491129796 | 0 | dfq2wrx | t3_62wye0 | null | null | t1_dfprfnr | null | 1493725279 | 14 | t5_2fwo | null | null | null |
null | [deleted] | null | Yeah, I'm sure _Rust_ is exactly why no one is learning Ada... | null | 0 | 1491129618 | False | 0 | dfq2yhc | t3_62wye0 | null | null | t1_dfq2u4n | null | 1493725301 | 39 | t5_2fwo | null | null | null |
null | searchingfortao | null | It's an exercise in vanity, an effort by the interviewer to justify their own wasted time learning this stuff by forcing you to know it to work with them.
Don't fall for it. These people are terrible to work with. | null | 0 | 1491129722 | False | 0 | dfq2zia | t3_62xwba | null | null | t1_dfpwveu | null | 1493725316 | 12 | t5_2fwo | null | null | null |
null | jl2352 | null | Yeah, it would be pretty shit if they broke backwards compatibility. | null | 0 | 1491129756 | False | 0 | dfq2zug | t3_62c0k0 | null | null | t1_dfp8g89 | null | 1493725320 | 1 | t5_2fwo | null | null | null |
null | zamadatix | null | > no, just the ones you tell it to query.
Correct.
> kinda like when you setup your DNS servers on your router.
Unless your router automatically syncs the root zone to know the latest TLD nameservers so it can act as a recursive name server (i.e. is running bind or similar) then no ;). You're confusing how authoritative nameservers work vs how the backbone of DNS (the root system) works. Try setting your only nameserver to the root (i.e. not relying on 3rd parties to be working so they can cache/forward the current TLD nameservers to you) and see how far your clients get resolving names. I mean yes, one of your 3rd parties is likely to be up but not as likely as a 3rd party or the root as the latter pair is a superset that includes the first group.
>To better illustrate how both of the nameservers interact with each other, let’s imagine that you are at your computer and you want to search for pictures of cats so you type www.google.com into your Web browser to go to Google. However, your computer doesn’t know where the server for www.google.com is located, so your computer sends a query to a recursive DNS nameserver (OpenDNS) to locate the IP address of the website for you. The recursive DNS nameserver is now assigned the task of finding the IP address of the website you are searching for. If the recursive DNS nameserver does not already have the DNS record cached in it’s system, it will then query the authoritative DNS hierarchy to get the answer.
>Each part of a domain like www.google.com has a specific DNS nameserver (or group of redundant nameservers) that is authoritative.
>At the top of the tree are the root domain nameservers. Every domain has an implied/hidden “.” at the end that designates the DNS root nameservers at the top of the hierarchy. Root domain nameservers know the IP addresses of the authoritative nameservers that handle DNS queries for the Top Level Domains (TLD) like “.com”, “.edu” or “.gov”. It first asks the root domain nameservers for the IP address of the TLD server, in this case, “.com” (for google.com).
>Afterwards it asks the authoritative server for “.com”, where it can find the “google.com” domain’s authoritative server. Then “google.com” is asked where to find “www.google.com”. Once the IP address is known for the website the recursive DNS server responds to your computer with the appropriate IP address. The end result of which is that you are now happy because you can search pictures of cats all day long. Below is an illustration of the process:
[Source of text](https://umbrella.cisco.com/blog/blog/2014/07/16/difference-authoritative-recursive-dns-nameservers/#sthash.CqDEFPMl.dpuf) | null | 0 | 1491129808 | False | 0 | dfq30ev | t3_62vx64 | null | null | t1_dfpzh9m | null | 1493725327 | 3 | t5_2fwo | null | null | null |
null | GinjaNinja32 | null | Because an epoch is far smaller and far easier to store. A single integer on each user, compared to a list of session IDs with expiration etc. | null | 0 | 1491129833 | False | 0 | dfq30nl | t3_62ul90 | null | null | t1_dfq0wae | null | 1493725330 | 2 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 0 | 1491129856 | 1491130696 | 0 | dfq30we | t3_62wye0 | null | null | t1_dfpzay4 | null | 1493725334 | 1 | t5_2fwo | null | null | null |
null | nyarlathocat | null | I'm currently trying to do just that within Emacs, and so far, I'm not so sure that just any meta-language is really good enough to make it comfortable across the board.
Right now I'm working on some Emacs modules. And overall, I totally agree with your point: Emacs Lisp is not a good language, but thanks to macros, I've been able to fix a lot of problems in the language with just a little bit of very straightforward code all from within. I've gotten rid of most boilerplate, I have much better data types (backed by structs), all my functions are short and pretty obvious, so that's all great.
(Unlike a lot of the "normal" Emacs code I see people write, which is very low level and totally unfit for their domains. Like ok, single global namespace, lots of messy global state, somewhat rudimentary macro system, that kinda stuff sucks, but still, it's so easy and rewarding to grow the language towards the pseudo-code you'd like to write, even despite all of that, so I don't get why rarely anyone seems to do actually do that!)
But anyway, so the main problem I have is that I don't have a lot of compile-time safety. I started to extend my macros to add useful runtime contracts, but I really miss having even a basic type system or even just statically resolved names. But I'm not sure how to actually add that. The actual checking logic is easy to do by piggy-backing on a simple Prolog (and I'd probably use a simple gradual type system that's easy to retrofit and grow), but the only way I can see to actually add the necessary type / name info is:
- write a complex code walker
- at least partially re-implement Emacs's macro expander
- expand stuff myself, annotating literals, declarations etc with their types
- do type-checking and name resolution
- hand over code (either raw or already expanded) to the normal Emacs macro expander
- and in order to get precise errors, I'd also have to annotate symbols etc with their source location
And that looks to me like I'm just using Emacs's meta-language to implement a better meta-language (basically a modern Scheme) and then use that instead.
I'm not sure how smooth the interop with old code will be, how painful it will be to write a code walker or macro expander for even just the subset of Emacs Lisp I personally use, especially with all the tricky basic forms and messy scope issues, and I doubt that stuff like auto-completion or documentation lookup really survive that major extra level of indirection.
At which point I might as well throw away all the integration, just write a "better meta-lang -> Emacs Lisp" compiler with new reader, new major-mode and tools, and write my modules in that, and so make the existing meta-programming abilities of Emacs Lisp irrelevant. | null | 0 | 1491130004 | False | 0 | dfq32bz | t3_62ixbc | null | null | t1_dforiy8 | null | 1493725353 | 2 | t5_2fwo | null | null | null |
null | searchingfortao | null | These are terrible questions to ask would-be co-workers. This doesn't filter for programming qualifications, but rather tests to see if someone remembers all of the irrelevant shit they had to memorise for a compsci class.
Have them write a simple program, that may or may not be related to your work. *Pay them for their time* and measure the output based on the following:
* Is the code clean, readable, and testable?
* Does it show a strong grasp of the benefits and limitations of the language and framework?
That's what *really* matters on the job. I don't care if you can write the slickest algorithm ever if no one can understand your code or if you're too egocentric to use an established library to get the job done. | null | 0 | 1491130136 | False | 0 | dfq33ky | t3_62xwba | null | null | t3_62xwba | null | 1493725369 | 12 | t5_2fwo | null | null | null |
null | Futakitty | null | You can invalidate jwt by giving them a unique id and setting up a blacklist. | null | 0 | 1491130228 | False | 0 | dfq34hc | t3_62ul90 | null | null | t1_dfq2c3i | null | 1493725382 | 3 | t5_2fwo | null | null | null |
null | achen2345 | null | I hadn't through about reading both samples together in a single pass. I will think about this. A different micro-improvement I thought of recently is using arrays instead of objects to contain the counts per item as arrays are a bit faster to access.
Suggestion added for later examination: https://github.com/prettydiff/prettydiff/issues/427
I want to spend time on this right now, but I have a career destroying military test tomorrow that I must really study for. | null | 0 | 1491130391 | 1491130870 | 0 | dfq361f | t3_62iuku | null | null | t1_dfq0abw | null | 1493725402 | 1 | t5_2fwo | null | null | null |
null | Deadhookersandblow | null | And how many of them did you implement without looking it up on google or CLRS | null | 0 | 1491130409 | False | 0 | dfq367a | t3_62xwba | null | null | t1_dfq0eb3 | null | 1493725404 | 18 | t5_2fwo | null | null | null |
null | skizmo | null | great title. | null | 0 | 1491130720 | False | 0 | dfq399i | t3_62z2fv | null | null | t3_62z2fv | null | 1493725445 | 2 | t5_2fwo | null | null | null |
null | frequentlywrong | null | On the other hand if you left and someone needs to take over or project grows in size/importance and additional people need to start working in it, Rust makes a lot of sense from the companies point of view. | null | 0 | 1491130743 | False | 0 | dfq39hd | t3_62wye0 | null | null | t1_dfpt5u4 | null | 1493725449 | 3 | t5_2fwo | null | null | null |
null | kaeedo | null | Tell me more | null | 0 | 1491130749 | False | 0 | dfq39jb | t3_62vx64 | null | null | t1_dfpzgj1 | null | 1493725449 | 5 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 1 | 1491130859 | False | 0 | dfq3anm | t3_62xwba | null | null | t1_dfq2zia | null | 1493725464 | -1 | t5_2fwo | null | null | null |
null | GraphiteCube | null | Not since long time ago. | null | 0 | 1491130894 | False | 0 | dfq3azn | t3_62vx64 | null | null | t1_dfq211p | null | 1493725468 | 3 | t5_2fwo | null | null | null |
null | alex_w | null | That is how DNS works, yes. It wouldn't query your ISPs' unreliable servers though, which was /u/SuperImaginativeName's complaint. It would query servers owned by companies in the business of having reliable DNS servers. | null | 0 | 1491131010 | False | 0 | dfq3c3s | t3_62vx64 | null | null | t1_dfpyfjw | null | 1493725484 | 6 | t5_2fwo | null | null | null |
null | rydan | null | http://kotaku.com/nintendo-switch-is-getting-seiken-densetsu-collection-i-1793471524 | null | 0 | 1491131040 | False | 0 | dfq3cef | t3_62t4jt | null | null | t3_62t4jt | null | 1493725488 | 2 | t5_2fwo | null | null | null |
null | combinatorylogic | null | > But anyway, so the main problem I have is that I don't have a lot of compile-time safety.
Yes, in order to do it in a dynamically-typed host language you have to ditch the interoperability (or wrap it into an annotated layer). Then you can have as much type safety in your DSL layers as you like, but you still cannot control anything outside of your typed sandbox.
> write a complex code walker
A must have anyway, even for the simplest of the macros you're writing. I'm very much in favour of the Nanopass approach, which means a lot of code rewrites before it's lowered down to something your macro can spit out into its host language.
> at least partially re-implement Emacs's macro expander
Which is relatively trivial. DSLs need their own macro expanders anyway.
> do type-checking and name resolution
Of course. You don't want to deal with Emacs dynamic scoping anyway, so you need your own name resolution.
> and in order to get precise errors, I'd also have to annotate symbols etc with their source location
Yes, that's my biggest grievance with Lisps in general. S-expressions suck in passing AST metadata. In my language construction framework I departed from using Lisp lists for ASTs completely - got a far better performance and tons of useful metadata (like location, pretty-printing hints, etc.). It still runs on top of a Lisp though.
> And that looks to me like I'm just using Emacs's meta-language to implement a better meta-language (basically a modern Scheme) and then use that instead.
And that's totally fine. I consider any meta-language as just a low level host for running my own hierarchy of languages on top.
You can have a look at an overview of my approach here: https://combinatorylogic.github.io/mbase-docs/intro.html
And any time I have some host meta-language I just build a set of tools like this, which is exactly a "better meta-language on top of whatever", and then do everything in that better meta-language, relying on the host macro expansion at the very final stage only.
| null | 0 | 1491131145 | False | 0 | dfq3det | t3_62ixbc | null | null | t1_dfq32bz | null | 1493725501 | 1 | t5_2fwo | null | null | null |
null | MarcusOy | null | Good read for beginners. | null | 0 | 1491131204 | False | 0 | dfq3dza | t3_62yl50 | null | null | t3_62yl50 | null | 1493725508 | 34 | t5_2fwo | null | null | null |
null | Dremlar | null | I'm not sure why, but I lock up in interviews. I look at those questions and can easily do them right now. However, I'll be honest and say in an interview I'm probably going to step on my own feet. :( | null | 0 | 1491131339 | False | 0 | dfq3ffo | t3_62xwba | null | null | t1_dfq2744 | null | 1493725530 | 17 | t5_2fwo | null | null | null |
null | Mehnou | null | oustanding comment. | null | 0 | 1491131464 | False | 0 | dfq3gsk | t3_62z2fv | null | null | t1_dfq399i | null | 1493725548 | 3 | t5_2fwo | null | null | null |
null | lx45803 | null | They do. I'm told you can turn that off if you get an account, but fuck that. | null | 0 | 1491131526 | False | 0 | dfq3hfi | t3_62vx64 | null | null | t1_dfq211p | null | 1493725556 | 4 | t5_2fwo | null | null | null |
null | alex_w | null | An integer epoch would be far smaller but it's not much less work at all vs. just looking up a session token.
JWT session:
* Decode the base64+JSON into payload + header + sig
* Verify sig
* Lookup the user (to get their epoch). User would be indexed, super quick.
* Check the epoch
Regular token session:
* Take the token from the session
* Lookup the session and the related user. The token is indexed, as is the user, basically just as quick.
Both need a db lookup. | null | 0 | 1491131543 | False | 0 | dfq3hma | t3_62ul90 | null | null | t1_dfq30nl | null | 1493725558 | 4 | t5_2fwo | null | null | null |
null | ThisIs_MyName | null | He's probably thinking of people wasting server memory by creating many new sessions and discarding the session cookie every time.
If you save a lot of data server-side for each session and use in-memory storage like redis, it can be a DoS risk.
| null | 0 | 1491131573 | False | 0 | dfq3hx0 | t3_62ul90 | null | null | t1_dfpya62 | null | 1493725562 | 3 | t5_2fwo | null | null | null |
null | mallardtheduck | null | That would allow the Pi to control command.com and the tiny number of applications that exclusively use the DOS i/o API. If, as is highly likely, your DOS application makes BIOS calls or directly accesses hardware, that won't work. | null | 0 | 1491131651 | False | 0 | dfq3ir5 | t3_62sqe6 | null | null | t1_dfpghye | null | 1493725574 | 1 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 0 | 1491131829 | False | 0 | dfq3kmt | t3_62yy8b | null | null | t3_62yy8b | null | 1493725598 | -4 | t5_2fwo | null | null | null |
null | alex_w | null | Not sure what you mean. The claim in a JWT would still be just as valid after a password change.
Unless you're relating some claim to a field on the user. Like checking the JWT's `iat` is after the User's `password_last_changed_at` or something? | null | 0 | 1491131869 | False | 0 | dfq3l2s | t3_62ul90 | null | null | t1_dfpmps4 | null | 1493725605 | 3 | t5_2fwo | null | null | null |
null | GinjaNinja32 | null | JWT with an epoch is no worse than JWT without. There's less cryptography in a session token based system, sure, but I don't see that as a downside to JWT - the advantage of JWT is that you don't have to store a centralised list of valid tokens, which doesn't change by having an epoch. | null | 0 | 1491131974 | False | 0 | dfq3m6n | t3_62ul90 | null | null | t1_dfq3hma | null | 1493725619 | 1 | t5_2fwo | null | null | null |
null | Katonia9137 | null | Very bad way to organize a tutorial. And `void main` is wrong. | null | 0 | 1491132012 | False | 0 | dfq3mky | t3_62yy8b | null | null | t3_62yy8b | null | 1493725625 | 4 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 1 | 1491132013 | False | 0 | dfq3mlc | t3_62yl50 | null | null | t3_62yl50 | null | 1493725625 | 1 | t5_2fwo | null | null | null |
null | stesch | null | 1 to 4 can be found on Google. 5 should be known. 6 and 7 can be found by scanning the list of array functions. 8 (palindrome test, not the one from the Stack Overflow list) can be found on Google or you apply the answer to question 1.
Everything in you own environment at your own time. You are on the phone when you are free to and then you get the questions by e-mail and the clock starts a few minutes later.
And no, the questions weren't my idea. I was the one who proposed to replace question 8 with a simple palindrome test to make it easier and possible in 1.5h.
I'm the one who prefers Python and is now faced with the fact that nobody is interested in letting the new employees learn enough Python for me to explain some of the Python projects before I'm leaving. (4 1/3 months notice isn't really enough time for some employers …)
| null | 0 | 1491132133 | False | 0 | dfq3nv1 | t3_62xwba | null | null | t1_dfq3ffo | null | 1493725641 | 4 | t5_2fwo | null | null | null |
null | mech_eng_lewis | null | How can people get a degree in comp science and not ace this test!? Like even if you were not allowed to use the standard library it's still pretty easy to do. | null | 0 | 1491132418 | False | 0 | dfq3r2e | t3_62xwba | null | null | t1_dfq2744 | null | 1493725685 | 6 | t5_2fwo | null | null | null |
null | chrissoundz | null | Hey well done! Looks useful. Readline looks quite cool to play around with - I'm surprised it doesn't require more code and C and all sorts of stuff. | null | 0 | 1491132474 | False | 0 | dfq3ro4 | t3_62u62i | null | null | t3_62u62i | null | 1493725692 | 1 | t5_2fwo | null | null | null |
null | ConcupiscibleEther | null | [Hmmm...](https://i.imgur.com/eAlj0qK.gif) | null | 0 | 1491132490 | False | 0 | dfq3rua | t3_62vx64 | null | null | t3_62vx64 | null | 1493725695 | -2 | t5_2fwo | null | null | null |
null | josefx | null | It isn't even that much of an issue, just [turn it off and on again](https://www.engadget.com/2015/05/01/boeing-787-dreamliner-software-bug/) every now and then. | null | 0 | 1491132492 | False | 0 | dfq3ruz | t3_62wye0 | null | null | t1_dfq18v8 | null | 1493725695 | 3 | t5_2fwo | null | null | null |
null | _Mardoxx | null | His solver doesn't short circuit this. It takes lile 60 seconds to realise that HTHTHTHTHT has no soln | null | 0 | 1491132581 | False | 0 | dfq3suc | t3_62jt57 | null | null | t1_dfouftx | null | 1493725708 | 1 | t5_2fwo | null | null | null |
null | unpopular_opinion | null | https://www.cl.cam.ac.uk/~pes20/lem/ allows one to specify in one language and prove the theorems in whatever system is most practical (e.g. already has proofs available).
There are more tools of the form X2Y, where X is Isabelle and Y is Coq for example. Don't have the links now, but this is clearly something people have been thinking about and I'd say at the very least prototypes exist.
https://github.com/pirapira/eth-isabelle uses LEM, for example and this is a commercial entity. | null | 0 | 1491132716 | False | 0 | dfq3ucq | t3_62scvv | null | null | t1_dfpn0al | null | 1493725728 | 1 | t5_2fwo | null | null | null |
null | Montropolous | null | Noob question, how do you figure out which blocks of memory are for HP, gil, etc.? | null | 0 | 1491132722 | False | 0 | dfq3ufb | t3_62t4jt | null | null | t3_62t4jt | null | 1493725729 | 2 | t5_2fwo | null | null | null |
null | skizmo | null | o look ... the rust brigade has arrived. | null | 0 | 1491132884 | False | 0 | dfq3w9n | t3_62yy8b | null | null | t1_dfq3kmt | null | 1493725754 | 5 | t5_2fwo | null | null | null |
null | skizmo | null | It's spam | null | 0 | 1491132898 | False | 0 | dfq3wfw | t3_62yy8b | null | null | t1_dfq3mky | null | 1493725756 | 3 | t5_2fwo | null | null | null |
null | chrissoundz | null | Do you even Vim bro? | null | 0 | 1491132993 | False | 0 | dfq3xjh | t3_62u62i | null | null | t1_dfp8mpi | null | 1493725771 | 1 | t5_2fwo | null | null | null |
null | kurashu89 | null | I hate to say it, but there needs to be some shibboleth at some point in an interview. We ask a few different whiteboard questions in interviews but I'm not crazy about them (they're all better than "sort this list for me" though). I'd like to find ones that are more applicable to what we do on a day to day basis though. | null | 0 | 1491133135 | False | 0 | dfq3z56 | t3_62xwba | null | null | t1_dfq2hur | null | 1493725792 | 1 | t5_2fwo | null | null | null |
null | alex_w | null | You've traded looking up against a central list of tokens to looking up against a central list of (maybe just one) epoch per user at least. And lost the flexibility of invalidating individual logons, or even enumerating them?
For example Google's Auth/Settings area. You can see a list of all devices and sessions and revoke individually. | null | 0 | 1491133426 | False | 0 | dfq42gi | t3_62ul90 | null | null | t1_dfq3m6n | null | 1493725836 | 5 | t5_2fwo | null | null | null |
null | echo-ghost | null | > More importantly, I find certain reactions to Rust to be pretty disturbing and representative of the uglier parts of human nature
from the other side, I find the circlejerk around rust to be hiding it's true nature. It reminds me of the one around golang 5 years ago and now whenever anyone posts about golang everyone shits on it
all the rust fans are upvoting everything rust positive and downvoting everything rust negative - which means I can not get any realistic sense of the language. I don't know what it is like to use it for years, or in large projects, because everyone over promotes the good parts and hides the bad parts
if there was less of a jerk around rust I would consider it more, If people spoke about it's downsides instead of endlessly parroting what every other comment about it says then maybe I'd consider it for a project. But as it is right now all the hidden rust downsides make me keep myself and thus every component of my company away from it.
if the rust community wants to be taken more seriously they need to start talking from a more balanced perspective. | null | 1 | 1491133586 | False | 0 | dfq44a2 | t3_62wye0 | null | null | t1_dfpr0ia | null | 1493725861 | 5 | t5_2fwo | null | null | null |
null | Effnote | null | One reason would be that there is lots of software that is already written in C, which will at the very least need maintenance. | null | 0 | 1491133765 | False | 0 | dfq46e3 | t3_62yy8b | null | null | t1_dfq3kmt | null | 1493725890 | 1 | t5_2fwo | null | null | null |
null | GinjaNinja32 | null | >And lost the flexibility of invalidating individual logons, or even enumerating them?
You don't lose that by adding an epoch, you lose that by using JWT instead of a server-side list of sessions. | null | 0 | 1491133785 | False | 0 | dfq46mb | t3_62ul90 | null | null | t1_dfq42gi | null | 1493725893 | 1 | t5_2fwo | null | null | null |
null | alex_newkirk | null | I found them by searching memory with BGB's built-in debugger. For example, if the HP value on screen is 19, I'd search for 0x13. Then, narrow down the search results by taking damage and filtering to the new value. You can find those types of addresses very quickly once you learn the tools.
Strings can be found by looking for sections of bytes that could encode letter sequences. Taking advantage of places where you can insert your own text (like the name) can make building a character table easier.
The tougher ones are things like e.g. the movement speed multiplier. To find those types of values, you pretty much need to just poke around and expirement. You'll end up crashing the game a lot and making weird stuff happen, but that's part of the fun! | null | 0 | 1491133929 | False | 0 | dfq48b9 | t3_62t4jt | null | null | t1_dfq3ufb | null | 1493725916 | 4 | t5_2fwo | null | null | null |
null | stumpychubbins | null | DNS is just a protocol, that issue is because you normally have to go via your registrar and with the exception of hover registrars are mostly legacy players with absolutely no incentive or inclination to make their product any less shit | null | 0 | 1491133936 | False | 0 | dfq48e5 | t3_62vx64 | null | null | t1_dfq0lpc | null | 1493725917 | 3 | t5_2fwo | null | null | null |
null | alex_w | null | Sorry I thought the topic of this thread was:
> What is the JWT doing for you in that scenario?
Maybe we're just in agreement that JWT has its use cases and its shortcomings?
| null | 0 | 1491134000 | False | 0 | dfq494i | t3_62ul90 | null | null | t1_dfq46mb | null | 1493725927 | 3 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 0 | 1491134252 | False | 0 | dfq4c2u | t3_62szbn | null | null | t1_dfq2939 | null | 1493725966 | 1 | t5_2fwo | null | null | null |
null | knome | null | > In programming languages, the initial element of a sequence is assigned the index 0
This is not true for all programming languages. 1-based-index languages include algol 68, apl, awk, cfml, cobol, fortran, foxpro, julia, lua, mathematica, matlab, pl/i, rpg, sass, smalltalk, wolfram language, and xpath/xquery. Ada, pascal and object pascal appear to have different base indexes based on the type used as the index value.
[linko](https://en.wikipedia.org/wiki/Comparison_of_programming_languages_%28array%29#Array_system_cross-reference_list)
C used 0-index because it was calculating ( base pointer + index * sizeof element ). Many of the 0-index languages simplied copied its semantics. | null | 0 | 1491134386 | False | 0 | dfq4dox | t3_62szbn | null | null | t1_dfpzykb | null | 1493725988 | 2 | t5_2fwo | null | null | null |
null | oldprogrammer | null | I agree with your premise, but as with any development activity you make trade offs. It comes down to what is the larger concern for the application, raw speed or memory management or ease in reasoning about subprograms with side effect concerns or a batteries included ecosystem.
For raw speed, C would undoubtedly win. But for cross platform applications with consistent libraries perhaps that is Java. If your focus is heavy multi-threading and you're concerned with side effects, then Haskell. A systems programming language with GC but more functionally oriented than Java or C, go Ocaml.
The nice thing is that most of these other platforms/languages understand how to use C libraries so as with the C# System.Numerics mentioned below or Java's Direct ByeBuffers such as is used with OpenGL libraries, you can approach the speed benefits of C in some cases.
C is the cross platform Assembler language and except for micro code I don't know how you'd ever out perform Assembler, but sometimes you don't need to | null | 0 | 1491134450 | False | 0 | dfq4ei6 | t3_62s54t | null | null | t1_dfov4qp | null | 1493725999 | 2 | t5_2fwo | null | null | null |
null | kankyo | null | It's always going to continue being shit as long as they don't. | null | 0 | 1491134536 | False | 0 | dfq4fk3 | t3_62c0k0 | null | null | t1_dfq2zug | null | 1493726013 | 1 | t5_2fwo | null | null | null |
null | knome | null | Also, the off-by-one thing is less related to the starting value of the index and more related to the frequency of errors accessing one element past the end of an array in C, which not being bounds checked, happily returns whatever garbage happens to be there. | null | 0 | 1491134582 | 1491135627 | 0 | dfq4g4b | t3_62szbn | null | null | t1_dfpzykb | null | 1493726020 | 1 | t5_2fwo | null | null | null |
null | knome | null | > Explanation 6. Looking for a match
Except for a newline, of course. | null | 0 | 1491134757 | False | 0 | dfq4ia3 | t3_62szbn | null | null | t3_62szbn | null | 1493726049 | 1 | t5_2fwo | null | null | null |
null | hu6Bi5To | null | This is true, but... because of other Rust features (such as the borrow checker) reference counted pointers are used less in Rust than other non-GC languages.
In other such languages they're used both for the Rust case: when data has multiple owners and you don't know which one will be the one to use it last, but also for general memory safety, which Rust doesn't need due to the borrow checker. | null | 0 | 1491135018 | False | 0 | dfq4lno | t3_62wye0 | null | null | t1_dfpx12c | null | 1493726095 | 10 | t5_2fwo | null | null | null |
null | knome | null | > Explanation 7. Keeping your data safe
> Salt is an additional parameter added to the user password, which secures the generated hash.
A salt is used to keep attackers from being able to use pre-generated lists of "password" -> "hash" from checking your passwords. If the all the passwords used the same hash, users that happen to choose the same password would have the same hash, and an attacker could generate hashes for their password guesses and check all the hashes in the database for matches. By assigning each user a different hash, an attacker with a copy of your database will have to attack each user individually when trying to crack their passwords, greatly increasing the amount of work needed for them to determine user passwords.
Determining a users password at one site, due to the common practice of reusing passwords, often gives an attacker access to the users information on many sites. Hence the reason we don't want plain text or easily broken hashed passwords. | null | 0 | 1491135102 | False | 0 | dfq4mow | t3_62szbn | null | null | t3_62szbn | null | 1493726109 | 2 | t5_2fwo | null | null | null |
null | ThisIs_MyName | null | Well, it's open source isn't it? You can patch away the safeties if you want to. | null | 0 | 1491135161 | False | 0 | dfq4ngr | t3_62ul90 | null | null | t1_dfpsww9 | null | 1493726120 | 1 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 0 | 1491135304 | False | 0 | dfq4paf | t3_62xwba | null | null | t1_dfpwveu | null | 1493726143 | 5 | t5_2fwo | null | null | null |
null | sacado | null | Well, to be fair, if all the energy that went to rust went to ada instead, it would have been wonderful. | null | 1 | 1491135373 | False | 0 | dfq4q7n | t3_62wye0 | null | null | t1_dfq2yhc | null | 1493726156 | -1 | t5_2fwo | null | null | null |
null | knome | null | > Explanation 8. Overcoming the Language barrier
vier, fünf, sechs
I'm not sure this joke is programming related, nor if demonstrating non-ASCII characters could be construed as one of its purposes. More that the listener doesn't realize the joke is in German. | null | 0 | 1491135455 | False | 0 | dfq4rac | t3_62szbn | null | null | t3_62szbn | null | 1493726170 | 2 | t5_2fwo | null | null | null |
null | ubernostrum | null | > or you apply the answer to question 1.
Unless their answer to question 1 was something rather out of the ordinary, this will fail. Since you say you like Python, your test case is the string `u"an\u0303a"` -- it should be considered a palindrome, since visually/graphemically it is one, but a naïve string-reverse approach will conclude that it is not a palindrome.
(since palindrome checkers are in the class of questions that push me into "don't want to work for this company" territory, I have a tendency to respond to them by building solutions that hint at the real complexity of the problem, and also delivering a lecture on Unicode to the interviewer) | null | 0 | 1491135651 | False | 0 | dfq4ttb | t3_62xwba | null | null | t1_dfq3nv1 | null | 1493726204 | 9 | t5_2fwo | null | null | null |
null | morphemass | null | Amazingly I had a couple of those come up this month in regards to a pretty complex data analysis problem. Its the first time in years I've had to really think about these types of CS algorithms in regards to a piece of work that has crossed my desk.
I'm not ashamed to say that I ended up googling an implementation rather than waste time on an academic exercise. 15 minutes for a known good implementation with tests vs a couple of hours (or longer) to write something that I was confident of.
The value of these algorithms *to me* is in recognising the problem and knowing that the answer is out there; as interview questions I think they are terrible. | null | 0 | 1491135670 | 1491135926 | 0 | dfq4u1p | t3_62xwba | null | null | t1_dfpwveu | null | 1493726207 | 40 | t5_2fwo | null | null | null |
null | compiling | null | He means factoring large semi-primes (numbers with exactly 2 prime factors). | null | 0 | 1491135904 | False | 0 | dfq4x3w | t3_62jpnd | null | null | t1_dfo3i41 | null | 1493726249 | 1 | t5_2fwo | null | null | null |
null | thearn4 | null | For the fun of it, how would a multiplayer game written in a purely functional language (no mutable objects) sync between clients/players? | null | 0 | 1491136026 | 1491162029 | 0 | dfq4yqq | t3_62yl50 | null | null | t3_62yl50 | null | 1493726271 | 122 | t5_2fwo | null | null | null |
null | frequentlywrong | null | > and downvoting everything rust negative
Where do you see the evidence of that? I've seen a few articles that criticize rust at the top of /r/rust and /r/programming and plenty of valid points were acknowledged.
> If people spoke about it's downsides
I see no evidence of the /r/rust community shying away or dismissing criticism. Look at the 2017 roadmap, it is largely based on their 2016 survey of what people dislike about Rust. | null | 0 | 1491136186 | False | 0 | dfq50u2 | t3_62wye0 | null | null | t1_dfq44a2 | null | 1493726298 | 29 | t5_2fwo | null | null | null |
null | fiedzia | null | > I don't know what it is like to use it for years, or in large projects, because everyone over promotes the good parts and hides the bad parts
Considering the fact that stable Rust is just 2 years old, few people have years of experience with it, but I've never seen anyone "hiding bad parts". People do ask about its downsides sometimes and get useful answers. I'd suggest to ask for sharing such experience on Rust forum.
> if there was less of a jerk around rust I would consider it more
I keep my technical decision strictly technical.
> If people spoke about it's downsides instead of endlessly parroting what every other comment about it says then maybe I'd consider it for a project.
They do. Go to Rust forum (or Reddit), describe your usecase, and you are very likely
to get usable answers. Have you tried that? | null | 0 | 1491136187 | False | 0 | dfq50up | t3_62wye0 | null | null | t1_dfq44a2 | null | 1493726298 | 22 | t5_2fwo | null | null | null |
null | aeam | null | Re: it not being "hipster hype" , you sir were obviously not around during the glorious years of the massive Haskell circle jerk that used to be /r/programming. | null | 0 | 1491136189 | False | 0 | dfq50vm | t3_62wye0 | null | null | t1_dfpr0ia | null | 1493726298 | -5 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 0 | 1491136189 | False | 0 | dfq50vs | t3_62wye0 | null | null | t1_dfq50u2 | null | 1493726299 | 0 | t5_2fwo | null | null | null |
null | morphemass | null | > Most applicants had severe problems. PHP
I think we have found the root cause .... ;) | null | 0 | 1491136214 | False | 0 | dfq518f | t3_62xwba | null | null | t1_dfq2744 | null | 1493726304 | 13 | t5_2fwo | null | null | null |
null | therealshark | null | Does anyone how anything about this? This was one of the best source of high quality in depth tutorials for free. | null | 0 | 1491136222 | False | 0 | dfq51cc | t3_62zdsh | null | null | t3_62zdsh | null | 1493726304 | 5 | t5_2fwo | null | null | null |
null | nakilon | null | It's a problem of opensource and 'using popular frameworks'. I do hashing with salt in my own way and there is no way you crack it. This works similar to that 'Battery horse...' password strength xkcd. You can fap every day on that you use the same library as others do (that's some psychological shit that most of people can't do without it) and tell everyone around how it's beautiful that the whole world sees the source code of libraries you use, but that does not make sense. You are gonna cry tomorrow that the world is unfair but that typical copypaste monkey who does not want to learn programming, won't learn a lesson from the mistake of data loss because of too much love to 'using open software and popular trending frameworks', because of inability to learn. | null | 0 | 1491136263 | 1491136458 | 0 | dfq51x1 | t3_62ul90 | null | null | t3_62ul90 | null | 1493726313 | -4 | t5_2fwo | null | null | null |
null | fiedzia | null | > I'd be genuinely surprised if someone found a buffer overflow.
> oops
That's a perfect summary of safety of C. | null | 0 | 1491136375 | False | 0 | dfq53eu | t3_62wye0 | null | null | t1_dfprbgn | null | 1493726332 | 75 | t5_2fwo | null | null | null |
null | stesch | null | I knew of the real complexity. But nobody else did. There is only so much you can explain to non-programmers who want simple answers and at some point (especially when you gave your 4 1/3 months notice) you just don't care anymore.
I had to review the code of all the applicants and I would have liked to tell my employer that somebody really is into programming and recognizes the problems of 2 questions. Instead I had to write something like "didn't understand the question and answered for digits instead for numbers" and "works by coincidence" etc.
(**EDIT:** Changed "accident" to "coincidence". I'm no native speaker.) | null | 0 | 1491136502 | 1491136881 | 0 | dfq5540 | t3_62xwba | null | null | t1_dfq4ttb | null | 1493726355 | 1 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 0 | 1491136623 | False | 0 | dfq56pt | t3_62z7p7 | null | null | t3_62z7p7 | null | 1493726376 | -1 | t5_2fwo | null | null | null |
null | tkannelid | null | Thanks for describing the application in the title! | null | 0 | 1491136625 | False | 0 | dfq56qz | t3_62ys2x | null | null | t3_62ys2x | null | 1493726377 | 3 | t5_2fwo | null | null | null |
null | [deleted] | null | [deleted] | null | 0 | 1491136639 | False | 0 | dfq56yg | t3_62vx64 | null | null | t1_dfpt5ic | null | 1493726380 | 1 | t5_2fwo | null | null | null |
null | ThisIs_MyName | null | Not really. Your caches will warm up in a couple of hours and you can configure the server to refresh cached entries even if nobody requests them for a while. | null | 0 | 1491136647 | False | 0 | dfq5725 | t3_62vx64 | null | null | t1_dfq21zm | null | 1493726382 | 2 | t5_2fwo | null | null | null |
null | marcusklaas | null | Beautifully put. | null | 0 | 1491136706 | False | 0 | dfq57t4 | t3_62wye0 | null | null | t1_dfpr0ia | null | 1493726392 | 1 | t5_2fwo | null | null | null |
null | stesch | null | I recommended "The Python Paradox" etc. but nobody cared or understood the real skills needed for the job.
And I may have caused a hire with a sarcastic "normal for PHP users" in my conclusion. The red "WRONG!" in the review of some answers was ignored. | null | 0 | 1491136738 | False | 0 | dfq5892 | t3_62xwba | null | null | t1_dfq518f | null | 1493726398 | 2 | t5_2fwo | null | null | null |
null | RadioFreeDoritos | null | The author might want to consider rewriting the project in a safer language, such as Rust. | null | 0 | 1491136835 | False | 0 | dfq59o5 | t3_62wye0 | null | null | t1_dfq53eu | null | 1493726416 | 54 | t5_2fwo | null | null | null |
Subsets and Splits
Filtered Reddit Uplifting News
The query retrieves specific news articles by their link IDs, providing a basic overview of those particular entries without deeper analysis or insights.
Recent Programming Comments
Returns a limited set of programming records from 2020 to 2023, providing basic filtering with minimal analytical value.