Re: Number of BBCode params and permutation
Reply #16 – August 02, 2015, 03:11:13 pm
Instead of using an array of strings, you're using small integers.
Re: Number of BBCode params and permutation
Reply #17 – August 02, 2015, 03:15:00 pm
That link I posted is a much better solution though. We don't need to figure out all of the permutations at once. We can do it one at a time and see if it matches. If it matches, just return the match. I suspect that most of the time, it will be complete within a few permutations. This should speed it up for everything.
Re: Number of BBCode params and permutation
Reply #20 – August 04, 2015, 07:48:10 am
nods thats a very good idea, being able to use the intermediate results should be a help. We are still dealing with massive sets though, be interesting to see what happens to execution time when you get to a possible solution set of 36Billion, not that it should take that many to "find" a solution but still
Re: Number of BBCode params and permutation
Reply #21 – August 04, 2015, 12:44:48 pm
Driving from FL to NJ so I won't have this until later. I still think 14 parameters is ridiculous and ordering them might be better. So ultimately, the proposal I'd make is using the permutation method on save to get the parameters and then ordering them for later. I like what XF does with an AST. I think this is the future but that's another topic.
Re: Number of BBCode params and permutation
Reply #23 – August 05, 2015, 01:30:34 am
I have no idea about what that means, and I have no idea how it is supposed to work either. What I do know is just one thing: you both scared and shocked me, you are amazing dude!
Re: Number of BBCode params and permutation
Reply #27 – August 11, 2015, 03:05:34 pm
The permutations will always return the same number of keys it was passed ... so pass it 1,2,3 you will get 1,2,3 1,3,2 2,1,3 2,3,1 3,1,2 3,2,1 Not necessarily in that order but whatever the algo returns.