boyter

105 ms·

961.
by boyter 13y ago
I thought the Haswell CPU was more about reducing power usage then adding performance? I'd be curious to know how much effort was spent on the power consumption vs performance.
962.
Unifying the LinkedIn Search Experience(engineering.linkedin.com)
1 points by boyter 13y ago|0 comments
963.
by boyter 13y ago
Sorry about the late reply. I have considered it, but im trying to make most of it clickable filters on the right hand side which know what you are doing. I have more to add but havent gotten around to it yet is all.
964.
by boyter 13y ago
That's not strictly true. https://duckduckgo.com/?q=test compare to http://www.yandex.com/yandsearch?text=test&lr=20996 http://www.bing.com/search?q=test&go=&qs=bs&form... Shows that the results appear to be coming fro
965.
by boyter 13y ago
I hate the ..: all over the place. Looks like it is from Geocities. Not sure why you would have the search button not a button. With forms like this I would either have the button or nothing and expect users to hit the enter key. The colour
966.
by boyter 13y ago
Thanks. The infinite scroll will be gone soon due to complaints. I personally like it but I see everyone else's point of view.
967.
by boyter 13y ago
Great!
968.
by boyter 13y ago
Yes I have. So long as I am not holding my nose I can still pick them out. That might be due to the wines in Australia having very distinctive flavour's though.
969.
by boyter 13y ago
Hope you find it useful :)
970.
by boyter 13y ago
It's not total bullshit. For the record I am not a wine buff (more interested in beer personally) but it doesn't take long for the average drinker to learn to recognize the difference in taste between grape varieties in new world wines and
971.
by boyter 13y ago
Actually that's supported too, http://searchco.de/?q=def+reverse+repo%3Adjango restricted to bitbucket, http://searchco.de/?q=def+reverse+repo%3Adjango+url%3Abitbuc... or github http://searchco.de/?q=def+reverse+repo%3Adjango+url%3Agit
972.
by boyter 13y ago
It does, but its very phrase heavy and will try to match "def reverse" literally over "def" and "reverse". Where no matches are found it falls back to the latter though. See, http://searchco.de/?q=def+reverse as an example
973.
by boyter 13y ago
Thanks. I am working on the SEO, I will move over to searchcode.com in the next few weeks. As for your query... yes it actually searches for the quotes. Something like =~ is a valid search in it. I am in the process of building characterist
974.
by boyter 13y ago
Personally I don't have a big enough pain-point of emailing this out to use it but I totally get having something I think is cool that isn't getting much use http://searchco.de/ In your case maybe a video showing the advantage of this ove
975.
by boyter 13y ago
Could you maybe explain what it does at a high level and get them to maybe explain how they think it might work? It would probably be just as informative.
976.
by boyter 13y ago
Doing something like the following would classify as a poor query in my book with a very simple query plan, select * from table;
977.
by boyter 13y ago
Going to have to ask for an example. I am yet to have seen a basic CRUD app that had performance issues due to a bad coding algorithm. Certainly from poor queries but never from an bad algorithm. Keep in mind I would say that a simple CRUD
978.
by boyter 13y ago
The fact that someone can tell you what the big O of an algorithm is wont prevent that though. You would be better off following a decent peer review process and performance profiling the application.
979.
by boyter 13y ago
100% agree. For a web position I have no idea why you would ask them to write a tree parser or binary search algorithm which I experienced not that long ago. Asking about what happens at a low level when entering a URL however is a good que
980.
by boyter 13y ago
For a C++ I agree hence I mentioned it being important for certain cases, but for something like your standard CRUD app its probably not worth thinking about.
981.
by boyter 13y ago
Agreed. However it would probably be better to show someone some code with a loop in a loop and ask them why it could potentially be a problem. If they can tell you in Big O notation why its bad for large inputs then great, but so long as t
982.
by boyter 13y ago
I understand Big O. My point is for a lot of cases it doesn't matter, and just because someone can't throw off the top of their head the O complexity of some algorithm they just wrote in a stressful interview does not mean they don't unders
983.
by boyter 13y ago
That's only for cases of N over some value. An O(N^2) algorithm over a list of 10 is not going to break anything. I didn't mention not being able to reason out the complexity, only saying its O(N^2) off the top of your head when presented w
984.
by boyter 13y ago
Not sure if that's really relevant. Unless you are applying for a job where time is money stock trading or some such I don't see how knowing a method you are writing is O(log N) rather then O(N2) is useful. Its something to keep in mind sur
985.
by boyter 14y ago
Sorry that's actually what I meant. "I will be more productive with X because it has Y feature". They still tend to underestimate though. Don't get me wrong, i'm all for new technology but bleeding edge on new projects can be a recipe for f
986.
by boyter 14y ago
I agree. But I have seen many programmers claim they will be more productive in language/framework X because its new. As for cheap shots at PHP, I see PHP like the USA. Easy to take cheap shots at because its so large and runs so much. For
987.
by boyter 14y ago
As much as I dislike PHP as a language I am still insanely productive in it for dynamic websites. I enjoy being productive more then I enjoy using the latest languages/frameworks. So yes. I enjoy using PHP for all its faults.
988.
by boyter 14y ago
Wow its really coming along. Only one thing is missing from me living in this full time with browser tabs and the like is that I use my screens in portrait mode and would prefer to be able to tear off a tab and have it live in another windo
989.
by boyter 14y ago
Its a real pain when you want to inspect the files, delete or copy them. Try taking 300,000 files and copy them somewhere. Then copy 1 file which has the size of the 300,000 combined. The single file is MUCH faster (its also why we usually
990.
by boyter 14y ago
Not sure. I seemed to still be around in 2003 and then nothing. I'm tempted to see if I can get in contact with him now this has been mentioned.

More ›