ju-on stuff
not really gore/the actual deaths that much, but to spoiler is basically its more about the supernatural whatever ‘creature’ part of the thing then its that one house is bad juju, like some lady visiting there to check on the old lady living there/missin kid or somethin(forget) ends up getting got, then later at her apartment building theres now blu lady, somethin like if they see/get attacked by them but escape they can show up later where they are then and if they die there then can attack people near there. like different rules then i remember the american remake one being
guessin you were actually replying to serbian film bit? ye sounds like that forget what the thing was, like incest rape or somethin was like a one ‘extra bad’ thing i thought
edits: did finally got some normal weekend time where started to get bored even so i started workin on server, put in test version atleast of the just count up one seems work good like expected will reliably tell the lowest number, just not put in a second sort operation to optimize it more, just partially optimized currently by just checking the memory value if the ones that would get checked have this number below whatever then just check the next number, instead of actually doing the whole, highest number divided by the lower number in the array repointed position, if the remainder does not equal 0 whatever math check, and instantly breaking on first failure to increment and start at the top
but if i resort and have a new total tally, i can just not have to skip them at all by only having a list of the ones we need to check, but is fast as hell either way since its c and its doing a pretty small loop, should be able to do in the hundreds of thousands maybe million of checks per second on this athlon 200ge system
thats much faster than if you get the number way off and its like 1000x longer than it needed to be at that like 5000~10000 places per second actually fully computing/compiling the list
edits:
did a test build with optimized and unoptimized so i could compare couple scenarios for fun, was fair amount of reduction still in some instances, even though the sorting it first did most of the optimization, would be the checks number to be looking at, the attempts is the number of times it incremented the number that it then checked with the division/modulus thing to see if the numbers were divisible in the long one was like 1~1.5seconds or something and the rest of the time was the other one lol
gotta decide what wanna do for a prompt, but to for sure have something to pop up sayin that number is crazy high are you sure/option to put in a different number or something
for example, in the long one just the data files for this list would be like 1~5PB probably lol, bein its like 56 trillion entries, and 1 byte per character if you said average full path/file name was 30 characters per line thats 30*56(TB)=1680TB and a play time for it to loop one time like 2.6 some billion years at 25min average per entry
feel like once it goes past like ~250k entries where you talkin in the realm of probably 2~5years if its around normal television segment length average, that probably as big as it needs to be, as the user would add/change stuff well within that time probably