> > > > > here's a snippet. if it attack you put your hand in front of it and > > > > > say "down!". it's just the intro it's not even the area i'm working on > > > > > > > > # ==> i think work ended up in the read_many function despite > > > > the read_many_tensors function existing > > > > # ==> basically, one outputs partial tensors unless there is a > > > > region of all-cached or all-uncached > > > > # ==> the special cases are for runs of 0s on the left and > > > > right and can be ignored to start > > > > > > updated this line to: > > > # ==> the special cases are for disk exhaustion and runs of 0s > > > on the left and right, and can be ignored to start > > > > > > > > > > > def read_many(self, offset_lengths, progress, > > > > validate_sorted=True): > > > i'm guessing that basically this code is mostly implemented at this > > point and mostly needs to be cleaned up, fuzzed, and extensively > > further cleaned up and fixed, to address how it was made > > > > maybe i should assume the ops are placed, write the lines that use > > them, and then fuzz it, and then i can continue by rote. assuming all > > the logical problems have somehow been solved and i can reconstruct > > the solutions when encountering mistakes > > ok the 3/3 section looks too messy to interpret. i think i was trying
to run without syntax errors. not too messy to understand. > to (a) port old code for a read across sparse holes and (b) validate > that against the intuitive solution of fetch hole, read cache, fetch > hole, read cache, repeat. hopefully (a) encounters the points already > summarized ie it's the intuitive solution plus handling of 3 special > cases (0s on left, 0s on right, disk space exhaustion via usage > tracking)
