The Lounge 0001 [From the Beginning]

but idubbz diss track said he doesnt really have nice tats

Sodom and gamorrah

final fight/street fighter and what

1 Like


Gay stuff

Met someone doing power Isa research in China, learned RTAS is a thing

lol okie

Getting paid for mail in work Rossman style. Woot!!!

Also it’s officially been 2 weeks since I lurked L1. Proud of me

cleaning crusty keyboards?

Building a few powerbook and MacBook for a dude in california

What do you mean by “building”? Like, repairing broken ones (screen, storage, etc)?

Like he’s got original apple systems that need SSD’s, an ibook needs a new bezel, all the ram could be swapped out for timing reasons, basically he wants some autistic nerd to make a bunch of power books run as fast as their MacBook so they can do a bunch of showcase YT vids.

I would done stuff for my editor but he’s… Idk wtf he’s doing, I gave up on him

1 Like

coo i guess lol :stuck_out_tongue:

Apparently he wants to do some stuff on YT and has ppl offering him shit. Not sure if Tru but will wait and see

ye lol

had a package come empty whole thing exploded out of the envelope lol so now i get to be amazon karen like @TheDiddilyHorror

made a quick video for youtubes lol
forgot to add the singing


Gunna make a meme video soon that’s Carmen Sandie go SMV {Seinfeld music video}

like the bass theme?

after thinkin about the thingie some more. think decided on instead of having it auto update/re-finalize lists when you edit one that would effect other lists. think simpler and less compromising the goals on keeping it more simple format and stuff

to just make a command that updates every list, the other than the new code to do that, only change would be edit the index file to contain a number to denote the type of finalizing you did on that list, if you had, if you had modified it but not finalized it yet, have it display that info at the bottom of the table that shows the list contents when you are in the program, so you know which one you did last time etc

which is fairly minor format change, and to the index file which isnt the one i cared about really, was more the actual list format itself, the index is just so the program knows how to create the list, which lists if its multiplied/how many times etc. and this will be simple too just a number and a symbol maybe to detect if its there more reliably, and update the file if there isnt one(wont be necessary anyways since no one would be using it with lists that dont follow that format but, catch error and repair it in one shot)

op edit:
will take longer than only updating the lists that were affected, but that is the laziest way to do it if you are gonna be lazy and let it do it for you anyways, dont take long anyways so no big deal time wise unless you had many super long lists(bein on my athlon 200ge 3.2ghz zen 1, does over 10k placements per second in the slower calculate modes) so normal list of movies by category or whatever type of things will be done in normal calculator ‘instant’ on basically any modern computer

Yeah that rockapella did

coo lol

gonna take some notes/think a bit though if gonna mess with the format for the index anyways might double check some stuff, primarily how it does the multiplier detection and how many entries per list/index

maybe put in a number to say how many there is, maybe a symbol like * or something to denote a multiplier entry will follow, as well as the finalization/export type, if have to manually fix all my indexes anyways probably might as well do upgrades if i can at same time

hadnt looked at it in forever but it does reference the location so unless they gave a full path its db\listname for the entries so theres no conflict with the raw numbers(wasnt sure if had made sure that wouldnt be an issue, incase someone made a list with only numbers like 007 or something)

so might just leave that alone, does have a * for the duplication list option(s) forgot XD. but end of the file would work or just a different character maybe = would make sense in a way, some something like if detect end of file the type is 0, or if it reads = the next entry is the type, probably at the end of the file anyways

ye ended up bein = lol but got it that part in somewhat still doin busy work for it mostly now, got it in for the rand function(as test), then the end part of the main loopy bit there, where it does add/remove by name the list you entered, or move/duplicate multiply etc.

might be another one or 2 gotta do special thing for but all the main finalizing/exporting was the same bits of code for removes the multiplier from the index to get a nice list, then add it back when done, so already got that good from rand, to just treat that as a multiply number and remove from the working list, then write back updated number when done

doin full scale testing now messin with puttin in a timer/formatting and stuff

think format mostly done other than that minor issue, with the status update x0000 finished(the only lists you would be able to see it not being calculator instant so they know its doing stuff not frozen/crashed) gotta put in a go down a line at the end so the done prints more legibly

the not finalized is just for ones you never exported(or didnt have the = and number format for that) in which case it doesnt know what type to do, so they gotta finish editing and export that list then next time it will do it how they did it the last time

was doin it on the new laptop just for funzies so tiny resolution so had it print the output to a text file so no proper screenshot yet

got the done format thing fixed, but takin a stop and think for awhile on it, decide if do a simple, add another command like instead of compall have compallx and then it asks for a number then it goes that many times, vs trying to simplify indexing to be able to recursively search/list the, lists which reference other lists, what order they are in which is the lowest to highest, prevent issues if a user were to make a list that references a second list which references the first list creating some kinda infinite loop index

thinkin compallx but maybe somethin else will come to me, already ruled out doin some other sort method like by size(since movie lists would be more likely to contain many other lists), maybe could do by the actual data for how many segments/files would be in it not the number of entries/lists would probably be more reliable but not 100%.

the compallx option would just be you figure out or just remember, what is the maximum nested list you have and run that many times, say you had toy story in cartoon movies in cartoons in cartoon network, if you entered do it 4 times, regardless of any sort it would do it 100% of the time. is wasteful cpu wise, but other than that one list thats 200k there it would only be like 2 seconds to do all the other lists combined, and like 20max for that long one(like 40 on laptop set to 6w lol), so if they just said like 10x would only be couple min unless they had really long, or many really long lists, which you would only do when you did many changes that you are too lazy to track yourself

ended up adding one more number after the one sets the mode, to describe a depth level, which is just 1 higher than the highest in that list. so detection for looping/chaining loop etc lists, is just if a gap appears between 1 and whatever the highest number is then theres somethin not right. else you just redo running thru them all equal to the highest depth.

probably gonna add a -f to force it to do it now, since had the -a(after) option forever, but with the newer scheduled mode, in case they have a media player choice that doesnt have a press q to quit instantly like mpv

edits: stopped bein lazy and figured out the timer stuff so now it says per list if you run one, or the comp all per list, and a total time, in, if its over a 59 seconds


isnt accurate if the total time is below like .1 second elapsed, but its mainly for the total elapsed time so dunno if i care about that one XD

havent looked to see whats in my kernel on arch to see what timers are available/what speeds but looks like still normally only like .001 is the faster(ist maybe) option, but at a speed of ~10000 a second even for longer lists where there is order of magnitude more data to scan past to get to the correct entries, not sure how i would measure the speed to tell, but shorter ones below 10 obviously would be shorter than .001 s, bein its like .0001 to place even for really long lists, possibly even faster depending on list, maybe like 50-250 or something could be within that first ms even on my slow laptop

mostly just for fun/if you have very large data sets/lists maybe be useful in a verbose output, if one used to take longer but now its really short maybe it got edited incorrectly or something to make it smaller idk

1 Like