Members in Shoutbox
None.

Shoutbox Search
Search for:


Shoutbox Commands
/w [name] > Whisper
/r > Reply to last whisper
/me > Marks as action

Shoutbox Information
Moderators may delete any and all shouts at will.
Global Shoutbox
Please log in to shout.
Pages: < 1 « 1979 1980 1981 1982 1983 … 3578 >

[2016-1-20. : 5:22 am]
O)FaRTy1billion[MM] -- It has frames like a GRP :P
[2016-1-20. : 5:21 am]
O)FaRTy1billion[MM] -- Lo?s aren't GRPs, but they are already loaded there
[2016-1-20. : 5:21 am]
jjf28 -- how's a lo related to a GRP?
[2016-1-20. : 5:20 am]
O)FaRTy1billion[MM] -- jjf28
jjf28 shouted: looks like it just stores them raw in the "imageDat" buffer
I saw that, so should I add lo? reading functions to GRP or what do you think? ;o
[2016-1-20. : 5:19 am]
jjf28 -- the GRP class*
[2016-1-20. : 5:19 am]
jjf28 -- the GRP has several functions for reading portions of a GRP, prolly just everything I needed for "grpToBits"
[2016-1-20. : 5:18 am]
jjf28 -- remaking portions of it, sure
[2016-1-20. : 5:18 am]
Corbo -- Are you guys just remaking SC now?
[2016-1-20. : 5:17 am]
jjf28 -- ctrl+m+o to collapse all functions in a .cpp btw
[2016-1-20. : 5:16 am]
jjf28 -- within the GRP class
[2016-1-20. : 5:15 am]
jjf28 -- looks like it just stores them raw in the "imageDat" buffer
[2016-1-20. : 5:13 am]
O)FaRTy1billion[MM] -- I don't remember the lo? file format off the top of my head
[2016-1-20. : 5:13 am]
O)FaRTy1billion[MM] -- Or just add lo? accessing functions to GRP class
[2016-1-20. : 5:12 am]
O)FaRTy1billion[MM] -- Or should I add a special case?
[2016-1-20. : 5:12 am]
O)FaRTy1billion[MM] -- jjf28
jjf28 shouted: it looks like they're loaded in...
I just found that. Is it trying to just read them as GRPs?
[2016-1-20. : 5:12 am]
jjf28 -- ScData::LoadGrps
[2016-1-20. : 5:12 am]
O)FaRTy1billion[MM] -- If it's not found then iscript ID will be 0xFFFF
[2016-1-20. : 5:12 am]
jjf28 -- it looks like they're loaded in...
[2016-1-20. : 5:11 am]
jjf28 -- either surround the code using the IScriptEntry with "if ( iscriptBin.get<IScriptEntry>(search, offset) ) { ... }" or use a junk entry; assuming we expect some not-founds
[2016-1-20. : 5:09 am]
O)FaRTy1billion[MM] -- Oh, also where are GRPs loaded so I can load LO?s
[2016-1-20. : 5:05 am]
O)FaRTy1billion[MM] -- Also I don't know how to handle a script not found. SC does FatalError and doesn't really return :P
[2016-1-20. : 5:03 am]
O)FaRTy1billion[MM] -- dunno, I just did it with IScriptEntry search = iscriptBin.get<IScriptEntry>(offset);
[2016-1-20. : 5:01 am]
jjf28 -- just calc the offset from file start rather than memory start :)
[2016-1-20. : 4:59 am]
O)FaRTy1billion[MM] -- Also I don't know how to do that with buffer class
[2016-1-20. : 4:58 am]
O)FaRTy1billion[MM] -- SC does a lot more pointer-arithmetic-y stuff, but I'll spare this that :P
[2016-1-20. : 4:56 am]
O)FaRTy1billion[MM] -- I was just reading through the source at work and thinking about it
[2016-1-20. : 4:56 am]
O)FaRTy1billion[MM] -- I dunno what all I need other than buffer's get other than finding iscript header offset, but I haven't gotten that far :P
[2016-1-20. : 4:55 am]
O)FaRTy1billion[MM] -- I'm going to use the buffer class, just having an iscript class is useful for helper functions
[2016-1-20. : 4:51 am]
jjf28 -- I just abuse the buffer class for the easy "ensure data is found and don't crash if it isn't" behavior :P
[2016-1-20. : 4:50 am]
jjf28 -- if you wanna make a struct/class and use it like that you're welcome to
[2016-1-20. : 4:50 am]
O)FaRTy1billion[MM] -- really iscript could be fully used as just a buffer, but like functions for finding iscript headers are useful
[2016-1-20. : 4:49 am]
O)FaRTy1billion[MM] -- AiScripts does a lot more that isn't necessary for iscripts, and then some things not enough
[2016-1-20. : 4:49 am]
O)FaRTy1billion[MM] -- I just copied AiScripts, but not entirely. I need access to the buffer to read the iscript data so I just made that public
[2016-1-20. : 4:48 am]
jjf28 -- do the functions in the AiScripts class exhaust everything it would be used for?
[2016-1-20. : 4:42 am]
O)FaRTy1billion[MM] -- I don't know if I should use it, or make my own iscript class/whatever ;o
[2016-1-20. : 4:42 am]
O)FaRTy1billion[MM] -- I found an iscriptBin buffer thing, but nothing references it anywhere
[2016-1-20. : 4:42 am]
dumbducky -- That's silly. He lost it at the airport.
[2016-1-20. : 4:40 am]
O)FaRTy1billion[MM] -- that's funny, I was driving home and I just happened to come across some depleted uranium!
[2016-1-20. : 4:38 am]
dumbducky -- So this guy just lost 130 lbs of depleted uranium, and he decides to go to my alumni facebook group to ask for advice
[2016-1-20. : 4:36 am]
Generalpie -- >Not using ==D
[2016-1-20. : 4:36 am]
O)FaRTy1billion[MM] -- Moose uses D
[2016-1-20. : 4:35 am]
dumbducky -- What are you using now instead of C++?
[2016-1-20. : 4:35 am]
O)FaRTy1billion[MM] -- Should I play with chkd? I learned today it doesn't load iscript.bin ;o
[2016-1-20. : 4:26 am]
RIVE -- awww. fml
[2016-1-20. : 4:26 am]
RIVE -- :wob;
[2016-1-20. : 4:12 am]
O)FaRTy1billion[MM] -- :wob: :wob: :wob: :moose: :wob: :wob: :wob:
[2016-1-20. : 4:12 am]
O)FaRTy1billion[MM] -- Rage :wob: !
[2016-1-20. : 4:12 am]
Moose -- :farty:
[2016-1-20. : 4:12 am]
Moose -- Anyway, rage. :wob:
[2016-1-20. : 4:11 am]
Moose -- Only checked 11,996,000 fractions instead of 143,988,000, which helps it be that fast XD
[2016-1-20. : 4:11 am]
O)FaRTy1billion[MM] -- :wob:
[2016-1-20. : 4:08 am]
Moose -- My code for #73 wasn't totally naive, though, I used a way to generate better guesses for fractions in the bounds
[2016-1-20. : 4:07 am]
Moose -- Yes, it can, it's supposed to be that counting all of them takes forever (I counted them but with a faster algorithm)
[2016-1-20. : 4:07 am]
Dem0n -- math sux
[2016-1-20. : 4:07 am]
jjf28 -- o I think 72 can just be pure math'd, neat :)
[2016-1-20. : 4:07 am]
Moose -- Using a script to run it 100 times: real 1m35.955s, so figure 936ms on average
[2016-1-20. : 4:04 am]
Moose -- This is on a faster machine than the one I wrote the code on the first time
[2016-1-20. : 4:04 am]
Moose -- real 0m0.959s
[2016-1-20. : 4:02 am]
Moose -- I did it back in October 2013, in C++, too, lel
[2016-1-20. : 4:02 am]
Moose -- I found it
[2016-1-20. : 4:01 am]
dumbducky -- Why do you delete your solutions? Seems silly to me
[2016-1-20. : 4:00 am]
dumbducky -- That's a good point
[2016-1-20. : 3:58 am]
Moose -- You would just need to run a GCD algorithm and check if fractions are between 1/3 and 1/2 12000*11999 = 143,988,000 times
[2016-1-20. : 3:57 am]
Moose -- I don't have my solution to #73 anymore, but it wasn't terribly long due to the max denominator only being 12000
[2016-1-20. : 3:57 am]
dumbducky -- How long did 73 take to run? I was thinking about solving it naively just to see
[2016-1-20. : 3:56 am]
jjf28 -- #nextLevelStrats
[2016-1-20. : 3:56 am]
Moose -- And #73 I solved naively :P
[2016-1-20. : 3:55 am]
Moose -- To be honest, I solved #73 first, learned algorithms from other people, and then adapted them to #72
[2016-1-20. : 3:54 am]
dumbducky -- How do you go about solving that? I'm guessing the naive implementation would complete somewhere around the heat death of the universe
[2016-1-20. : 3:50 am]
jjf28 -- solve some math problem with programming before the heat death of the universe

Pages: < 1 « 1979 1980 1981 1982 1983 … 3578 >


Members Online: City, Zycorax