I have a certain problem where i need to store groups of data in groups of six, (a, b, c, d, e, f). And am wondering the best way to do this. My current ideas was to multiply the first value by 10000, and add the second value and repeat, so i can store it as a 3d point, (10000a+b, 10000c+d, 10000e+f), so that i can easily read it. Anyone have any better suggestions?
Make 2 lists of 3d points. Then, make sure that the indexes match for each pair of 3d points.
Say you have this:
(1,2,3,4,5,6)
It would become:
L1 = [(1,2,3)]
L2 = [(4,5,6)]
Then you can refer to each data point with L1 or L2, then .x .y or .z.
Is that what you want? I think your idea was interesting, but would need some more operations i think
Good idea, I’ve thought of that, but was already knee deep in my first idea, I’ve added functions that allow me to easily grab and add sets to the main list.
I think I prefer to have it all in one list as well for easier manipulation.
Thanks for the input though!
Your welcome, i guess.
I’m not exactly sure what you mean, is there and example you could give? Are you taking a list and making smaller subsets of that list, or trying to represent six numbers in one number?
I would prefer what @NTMDev suggested …
consider also that with your method if you have a value of 10001 you cannot know if it comes from a=1 and b=1 or from a=0 and b=10001.
Another possibility would be to simply use 6 lists.
Yes, what I was trying to say.
How would you backtrack from the computed value?
He wants to combine 6 data points together, like a tuple in python.
i cant code : (
To back track I can divide by 10,000 and take the floor of the value, (all are integers) and take the mod of 10,000 for the second value
The goal is to store six numbers in a point, so that I can have a list of these points. My current strategy is that I take a function, which takes six inputs, and returns a 3d point where each number is as described above.
I had thought through that, but figured that no number would be greater than 10000 for my purposes.
if I ever find a case where I need a larger number I have added a slider that increases the size up to 10^10.
For the purposes I need, only “a” or “b” would even have a chance of reaching that point, and by then, Desmos would be laggy
I should probably explain what I am making tho…
It will be a piano in Desmos, using the tone function. I made one a while back but it did not have many functions and I am trying to improve on the design
Yeah, what I meant by many operations. That is kind of inefficient.
Something very rough, but it might work.
However, I think you might need to completely change how you are using lists if you want to use this: Desmos | Graphing Calculator
Maybe having the lists stored as arrays where (data, list number)?
You cannot store a list of points in a list, if that is what you mean.
Maybe like this:
L_{0}\left(x\right)=\left{x=1:L_{1},\ x=2:L_{2},\ x=3:L_{3},\ x=4:L_{4},\ x=5:L_{5},\ x=6:L_{6}\right}
A=\left[\left(L_{0}\left(\operatorname{ceil}\left(\frac{X}{5}\right)\right)\left[\operatorname{mod}\left(X-1,\ 5\right)+1\right],\ \operatorname{ceil}\left(\frac{X}{5}\right)\right)\operatorname{for}X=\left[1,…6\operatorname{count}\left(L_{1}\right)\right]\right]
f_{0}\left(n\right)=\left(A\left[A.y=n\right].x\right)
f\left(n,\ m\right)=f_{0}\left(n\right)\left[m\right] ?
You could make one big list where every six is a group. You can filter to pull a group’s list of values and index that list as I do here. Whether that’s useful or efficient may depend on how you’re using it.
This is what I am currently doing: Untitled Graph | Desmos
If you are doing that, then just use two lists of 3d points. No need to make it that complex.