Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
Search - "list ordering"
-
I decided to run the ROCKYOU password list to see if there are any patterns in md5 hashing, not sure why but I am starting to confuse myself and I need a new pair of eyes to have a look.
in advance, sorry for the shitty image, that lappy is a temporary solution.
So the very accurate and not bias numbers show that the letter "0" appears more than the rest, would there be any use in let's say ordering the wordlist with words that have the most "0" and "7" in their hash to appear at the top?
I believe I might be trying to stretch the numbers and see a pattern where there is none but its worth a shot I think.
Note:
- These numbers come from only about ~14m words
My thinking trail is that if statisticaly these hashes are more likely to appear, they are more likely to be the one I am looking for?3 -
Is GraphQL worth it? It promisses to keep some load away from backend programmers but what about this scenario:
There's a list of items with scroll load/infinite scroll. There can be several filters as well as the Option to change the ordering of the list items.
With "traditional" REST, I'll hit the DB with one request, get the data in the right order to the backend, might itterate over it once to add additional information, cache the result in Redis/Memcache and send it off.
Using GraphQL, the frontend has to load all entries first, sort them in JS (which probably is slow on mobile devices), and then display it. No matter how "expensive" the query is, there's no caching.
Is that about it? Did I get something backwards?2 -
!rant , a question (on the end, after explanation) :
https://youtube.com/watch/...
this is a result of (according to my time tracking) 10 hours and 50 minutes of coding.
captures mouse cursor into list of points, uses those to triangulate a flat polygon (manually doing all the mesh math of ordering them correctly, earclip triangulating, and indices generating), as well as to create inner and outer outline (no official algorithm, my own which I came up with on the spot) of a certain thickness.
(the outline drawing is just for debug yet, now I'm going to extrude them upwards to form walls)
soooo... I've been always curious about how effective/fast/efficient of a programmer I am, but it's usually hard to measure/compare, so I thought I'd try this way: how long do you think implementing something like this would take YOU?
thanks :)5