r4m0n changed the topic of #kspmodders to: Technical discussion ONLY (KSP related or not), for random shit-talking, join #shitshow (seriously)
K3|Chris has quit [Quit: ChatZilla 0.9.92-rdmsoft [XULRunner 35.0.1/20150122214805]]
fcbayerndm has joined #kspmodders
Raidernick_ has joined #kspmodders
Raidernick has quit [Ping timeout: 383 seconds]
GlassYuri has joined #kspmodders
fcbayerndm has quit [Quit: fcbayerndm]
<SilverFox> GlassYuri, having recurring places in dreams is normal
<GlassYuri> that's great I guess
<GlassYuri> just wish I could visit some of them IRL ;)
<SilverFox> also, do you have ternaries in there?
<SilverFox> ternaries are a must in your code
m4v has quit [Ping timeout: 207 seconds]
<GlassYuri> you mean ?: ?
<SilverFox> yeah
<GlassYuri> not very many I think, I use them a lot more in some of my other projects
<SilverFox> <condition> ? <true> : <false> ;
<GlassYuri> in my adventure game I have one place where I chained them
m4v has joined #kspmodders
<SilverFox> I chained some in KWS
<SilverFox> having them in array brackets is great
<GlassYuri> but yeah, they are one of my favorite features in any c-like lang
<GlassYuri> actually had another student compliment me on my java code just because I had ?: and @supresswarnings in there
<GlassYuri> the latter was just an automatic suggestion by eclurpse
<GlassYuri> anyway have to leave for school
GlassYuri has quit [Ping timeout: 182 seconds]
icefire has quit [Quit: Leaving]
m4v has quit [Ping timeout: 182 seconds]
m4v has joined #kspmodders
Glass|phone has joined #kspmodders
<Glass|phone> so I just had to present something and I of course screwed that up
<Glass|phone> but everyone was applauding at the end which they didn't for the other presentations
angavrilov|phone has joined #kspmodders
angavrilov||phone has quit [Ping timeout: 198 seconds]
angavrilov||phone has joined #kspmodders
angavrilov|||phone has joined #kspmodders
angavrilov|||phone has quit [Read error: Connection reset by peer]
angavrilov|||phone has joined #kspmodders
angavrilov||phone has quit [Ping timeout: 207 seconds]
angavrilov|phone has quit [Ping timeout: 383 seconds]
GlsFrg|phone has joined #kspmodders
Glass|phone has quit [Ping timeout: 186 seconds]
angavrilov|phone has joined #kspmodders
angavrilov|||phone has quit [Ping timeout: 182 seconds]
Hyratel has quit [Read error: Connection reset by peer]
Hyratel has joined #kspmodders
GlassYuri has joined #kspmodders
Glass|phone has joined #kspmodders
GlsFrg|phone has quit [Read error: Connection reset by peer]
angavrilov||phone has joined #kspmodders
angavrilov|phone has quit [Read error: Connection reset by peer]
angavrilov|phone has joined #kspmodders
angavrilov||phone has quit [Ping timeout: 182 seconds]
angavrilov||phone has joined #kspmodders
angavrilov|phone has quit [Ping timeout: 383 seconds]
icefire has joined #kspmodders
SilverFoxy has joined #kspmodders
<SilverFoxy> VS code isn't as neat as I thought it would be
<SilverFoxy> I tried starting a C# project in it, but couldn't easily do so without thinking I had to write all the boilerplate stuff that makes a C# class and project a C# class and project.
GlassYuri has quit [Quit: Leaving]
<SilverFoxy> installed visual studio 2017
<SilverFoxy> didn't even come with C# project templates
<SilverFoxy> hard part in making this superpermutator is figuring out how to generate the permutation sequence
SilverFoxy has quit [Ping timeout: 186 seconds]
SilverFox has quit [Ping timeout: 198 seconds]
FoxBot9000 has quit [Ping timeout: 383 seconds]
FoxBot9000 has joined #kspmodders
SilverFox has joined #kspmodders
<N3X15> I still prefer atom
<N3X15> Then again, it tends to freeze on large python projects since it uses jedi for autocomplete
icefire has quit [Quit: Leaving]
icefire has joined #kspmodders
<SilverFox> what is a good way of generating the possible permutations for an n-length sequence of numbers?
<SilverFox> for 3 length you have 123 132 312 321 as the possible ones, but how do I generate that with code?
<SilverFox> specifically not in a shitty way
<ve2dmn> Mathematically, it's a tree, so you only need to write and algorithm that output the same thing as something as the list of leaves
<SilverFox> right
<SilverFox> but how do I code that in a good way
<ve2dmn> define good: Efficient? Easy to read?
<SilverFox> uhh, efficiency is best here
<SilverFox> since this will be very computationally heavy
<ve2dmn> Then I don't know
<SilverFox> well fuck
<SilverFox> gimme what you got
<ve2dmn> I would create a list and call it recursively with n-1 size
<SilverFox> hmmm
BasharMilesTeg has joined #kspmodders
BasharMilesTeg_ has quit [Ping timeout: 198 seconds]
<SilverFox> well fuck
<SilverFox> I have this but the fuckin continue; in the second foreach doesn't do what I want to do
<SilverFox> if it doesnt contain the permutations, then it's a bad number, skip it
<SilverFox> I fixed it with a bool value
<SilverFox> how do I translate this to c#?
<SilverFox> it doesn't like char*
<ve2dmn> check the python example
<SilverFox> python sucks, I checked the java example
<SilverFox> I hardcoded the perms for 3 and then my laptop calced the result to be 123121321
<SilverFox> I need a value that's greater than a uint64
<N3X15> SilverFox, don't dismiss an algorithm just because of the language it's written in
<N3X15> you can still use it in another languge
<SilverFox> I know
<SilverFox> but I can't because im dumb
<N3X15> Learn bro
<N3X15> I have a python-based dependency-driven buildsystem that uses some loop detection code that I had to convert from C++
<N3X15> so it's a critical skill
icefire has quit [Read error: Connection reset by peer]
fcbayerndm has joined #kspmodders
<SilverFox> brute forcing the superperm of 6 would take 10^857 years
icefire has joined #kspmodders