Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
optimiz3
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
46 ms
·
451.
▲
by
optimiz3
13y ago
What you're not getting is a not-invented-here scripting language with idiosyncrasies deeply coupled to .Net. If only they had just improved the command line...rather than force every admin to learn a throwaway scripting language that
452.
▲
by
optimiz3
13y ago
This is actually a major annoyance in some fields - Xilinx for example likes to use GB to represent 1024^3 for storage on FPGAs while HDD manufacturers like to use 1000^3. IMHO [ZYEPGMK]?iB is the way to go to end this non-sense.
453.
▲
by
optimiz3
13y ago
Have an upvote for your sorrows. It takes guts to admit that in public.
454.
▲
by
optimiz3
13y ago
How so? Perfect hash functions only work when all possible inputs are known.
455.
▲
by
optimiz3
13y ago
While it is true that asymptotically 5 * O(m) equals O(m), in practice 5 * O(m) is still 5x slower. EDIT (reply threshold): "That's not how big-O notation works. It only applies to asymptotic behavior. It makes sense to say that i
456.
▲
by
optimiz3
13y ago
You pay for computing a hash function over directly walking to the next node. EDIT: Here you go. Some work I contributed a while ago when we were using Mongo. Replace hash table with a TRIE, deserialization performance goes up 40%. Because
457.
▲
by
optimiz3
13y ago
JSON/BSON parsing for one, you use the field name to walk the tree, then the node contains a function pointer for what to do with the member. Any scenario where you decode {k,v} pairs benefits from this.
458.
▲
by
optimiz3
13y ago
"chances are, if you're about to look something up, you've recently read it from somewhere and it's going to be hot in the cache" So a very common scenario for TRIEs/K-ary trees is for high-speed parsing - basi
459.
▲
by
optimiz3
13y ago
"no tree can ever compare performance-wise to a well designed hash table" This is not always true...if you have to hash strings when executing queries, data structures like TRIEs or naive 256-ary trees may be faster (where the O(s
460.
▲
by
optimiz3
13y ago
Prototyping - you just made an interface change that normally would have to be plumbed though hundreds of files just so you can experiment with one of them.
461.
▲
by
optimiz3
13y ago
IANAL, but any code written by the interviewee is likely not owned by the company, thus exposing the company to serious liability if said code is used in production. Most employment contracts have a "work for hire" clause with res
462.
▲
by
optimiz3
13y ago
TG's behavior strikes me more as trolling...the example you gave could play out like: NC: “After the first week he hasn't interrupted me with questions every hour, unlike some of the previous interns.” TG: “Which of the pre
463.
▲
by
optimiz3
13y ago
How would one productively store previously seen hash outputs? The problem is multi-fold: Storing the minimum target nonce seen during mining has a key-space of size 256+96=352bits { midstate + { merkle_root, ntime, nbits } }. So 1/2^3
464.
▲
by
optimiz3
13y ago
Yes - to be precise approximately 1/(2^32*difficulty) chance any one hash is a block solution.
465.
▲
by
optimiz3
13y ago
This is not true - the probability of mining a block in the future is relative to the time spent mining (a Binomial). The probability of finding a block does not change based on how long someone already has been mining. Consider a fair co
466.
▲
by
optimiz3
13y ago
Pretty much, a Microsoft account is a one-way trust relationship between your machine and Microsoft.
467.
▲
by
optimiz3
13y ago
No, it was always there in Windows 8. It's not always there in 8.1.
468.
▲
by
optimiz3
13y ago
Microsoft REALLY wants you use a Microsoft account over a Local account. The link to chose a Local account during install is gone. It only shows up if you get the Microsoft account login wrong, and there is no indication that a Local acco
469.
▲
by
optimiz3
13y ago
"Should programmers be held responsible for bad code" is a misleading title. The actual article is titled "Bad Code: Should Software Makers Pay?". There is a world of difference between the managing decision makers who
470.
▲
by
optimiz3
13y ago
This can be done far more simply in hardware. Simply look at the instruction decode pipeline, and XOR with the operand of the next instruction that consumes your return value to bias the result.
471.
▲
by
optimiz3
13y ago
Dale's reply does make sense. While it is true that: <random data> ^ <compromised random data> = <random data> If <compromised random data> has prior knowledge about <random data>, it can emit bits to bias
472.
▲
by
optimiz3
13y ago
From 2003 to 2005 I worked in Windows Mobile. In a mad dash to achieve checklist-style feature parity with RIM, features were bolted-on with little thought given towards achieving real cohesion amongst what was being built. The culture was
473.
▲
by
optimiz3
13y ago
Got it, thanks!
474.
▲
by
optimiz3
13y ago
So ruby isn't a primary language form me, but doesn't the tx.save in the rescue block cause a retry? Also the 500ms poll looks like it is coming from the client - that definitely seems like a no-no. You'd hit the server 60 ti
475.
▲
by
optimiz3
13y ago
Isn't this code just adding a single retry? What if it fails after that? EDIT: Also, is it really a good idea to poll every 500ms? Why not use long polling?
476.
▲
by
optimiz3
13y ago
This doesn't answer the author's question. We know the difference between performance and scalability. How does it perform compared to Java?
477.
▲
by
optimiz3
13y ago
Way to go, this completely describes Azure (and MSFT web) development. We've been using the MSFT stack for the last 4 years and this is 100% consistent with our experience.
478.
▲
by
optimiz3
14y ago
If you pay close attention to the lines around the woman's mouth in Clip 1, CRF 18.5 seems to have more defined lines and freckles (i.e. more signal in image processing parlance).
479.
▲
by
optimiz3
14y ago
I meant for RethinkDB (BTW - I've been a contributor for the MongoDB driver).
480.
▲
by
optimiz3
14y ago
What really bugs me about Mongo: https://jira.mongodb.org/browse/SERVER-863 The issue has been open for over two and a half years, is one of the most highly voted issues, and has yet to even have reached active engineering status. Agree w
More ›