Parallel query or make indexable #21
Description
Hello,
First, thank you for making this library available.
I have a unique use for the library which would be easier satisfied if the permutation collection could utilize indexing. Being able to go to permutation at 1,000,540 like you do with an array would be helpful. I understand this may be difficult as the permutations appear to be created on demand iteratively.
The next option would be generating the permutations in a parallel multi-threaded manner which preserves order so that when I search through the collection again for item 1,000,540 that I get the same permutation as before.
I have played around with PLINQ to something multithreaded (separate from this library) but the order of the generated permutations was never the same.
Building the list with your library and persisting it to disk in a database is an option but not the preferred one.
Any suggestions would be appreciated!