Nora, Tech Witch
hmm, any #rust peeps know why &[T] doesn't implement Index<usize>?
Obviously you can do
let slice = &[1, 2, 3];
slice[1];
but I'm not sure if I'm missing some sugar being applied here
And more importantly, how do I take anything indexable by usize generically if I can't take &[T] with I: Index<usize>?
Nora, Tech Witch
well, i had to give up some generality and just use &'a [T] instead of a generic indexable type, but that's ok for now
Nora, Tech Witch
aaaand done, for now. once I test it out with visn some more and in actual use I'll probably publish it as one or more crates (one for atci and one for the actual permutations, maybe)
it's also theoretically possible to remove the factorial memory constraint if i implement the algorithm in a different way, and that would definitely be nice.
i mean it's generating permutations so it's inherently a factorializing process but that doesn't have to extend to memory usage
Jonkman Microblog is a social network, courtesy of SOBAC Microcomputer Services. It runs on GNU social, version 1.2.0-beta5, available under the GNU Affero General Public License.
All Jonkman Microblog content and data are available under the Creative Commons Attribution 3.0 license.