sangupta

14 ms·

1. 91.▲
   by sangupta 9y ago

   Architect | San Jose | Sandeep Gupta | https://github.com/sangupta I am a developer architect and can help with backend/nosql/db/performance/design. Feel free to reach me at sandy.pec@gmail.com
2. 92.▲
   by sangupta 9y ago

   I 100% agree that the warning is displayed. But can't we not make that a bit more user-centric - to say, "You are going to remove all your files from your disk. This is IRREVERSIBLE." Would that not be a better info/warn
3. 93.▲
   by sangupta 9y ago

   The victim is not at fault. 1. On Windows, the standard mechanism to delete files it to move/ to 'Recycle Bin' - why did the IDE override the functionality? 2. In git, this action is equivalent to 'git checkout' tha
4. 94.▲
   by sangupta 9y ago

   I ran some performance tests and added a basic caching layer on reflection - that improved it by around 50% in the very basic of tests. You may look at the results in README at https://github.com/sangupta/gather repo.
5. 95.▲
   by sangupta 9y ago

   I haven't done performance benchmarking, nor tuned it yet. That's my next plan. The library is largely meant for firing ad-hoc queries in production, or for tweaking data-sets and database queries. Though reflection is slower, it
6. 96.▲
   by sangupta 9y ago

   Gather was aimed at JDK 7 since there is still a lot of legacy code around. For JDK 8, lambdas surely work better.
7. 97.▲
   by sangupta 9y ago

   Thanks. LINQ was definitely a part inspiration in its development. Let me know if you would like more features to be baked in.
8. 98.▲
   Show HN: SQL-like queries on in-memory Java collections/arrays(github.com)

   10 points by sangupta 9y ago|7 comments
9. 99.▲
   by sangupta 9y ago

   I prefer to use epoch as an additional timestamp - this allows us to parse the logs without being bothered about timezones and all.
10. 100.▲
    by sangupta 9y ago

    It could have been flagged by an algorithm, or may be some over-eager Discord developers to remove this post from public appearance.
11. 101.▲
    by sangupta 10y ago

    Skim through via my RSS reader, and read around 10-20 articles a day.
12. 102.▲
    by sangupta 10y ago

    Cute!
13. 103.▲
    Delta.com Airlines site is down(delta.com)

    1 points by sangupta 10y ago|0 comments
14. 104.▲
    by sangupta 10y ago

    Then how come its not yet banned ?
15. 105.▲
    by sangupta 10y ago

    Strange, but how do they still show the homeline for a user which is not accessible via API any more (as far as I understand).
16. 106.▲
    by sangupta 10y ago

    Loved this idea - started building such a service as my first side-project for 2017.
17. 107.▲
    by sangupta 10y ago

    I use a crowd-sourced hosts file on my system to block most of the ad-networks and metrics tracking sites. Check out https://github.com/StevenBlack/hosts
18. 108.▲
    by sangupta 10y ago

    For moving to a pricing model they will have to change the URL structure - breaking any code that relies on it today.
19. 109.▲
    by sangupta 10y ago

    Whats the pricing structure? Also, are your responses backed by a CDN?
20. 110.▲
    Notes on designing a rate-limited web scraper(github.com)

    3 points by sangupta 10y ago|0 comments
21. 111.▲
    by sangupta 10y ago

    Thanks a bunch. I mentioned similarities to bucket sort earlier in the day. I will go over the mentioned paper and also mention it as a reference.
22. 112.▲
    by sangupta 10y ago

    None that I know of and thus the inspiration to start this. I so intend to write on some pieces of software architecture that I have understanding of. For micro-services piece, if you specific sample well-defined problems, please do let me
23. 113.▲
    by sangupta 10y ago

    I can work up one. Choosing the right bucket will be O(1) as the index is integer. We can store the buckets for lookup in a hash-table or an array-of-arrays, which again will be O(1). Reaching to the actual index should again be O(1) - unle
24. 114.▲
    by sangupta 10y ago

    Wouldn't using a sparse bit-array be equivalent to using Bucketsort in space-complexity, but more efficient in time-complexity, or am I missing something here.
25. 115.▲
    by sangupta 10y ago

    Thanks a bunch for the link.
26. 116.▲
    by sangupta 10y ago

    I will read more about bucketsort and update the article as necessary.
27. 117.▲
    by sangupta 10y ago

    Using a sparse bit-array will reduce the memory space of the problem.
28. 118.▲
    by sangupta 10y ago

    My bad - that was a typo when writing. Updating it.
29. 119.▲
    by sangupta 10y ago

    Agreed about the phrase thing - updated the phrase accordingly to say: "Fastest sorting of bounded integers"
30. 120.▲
    Show HN: Design, data-structure, algorithm problems and their solutions(github.com)

    103 points by sangupta 10y ago|25 comments