I am wondering if we should return Permutation object from sortperm. There are also matrix factorizations where permutations are returned. It may be worth having Permutation types in Base, and some nifty utilities on them. Also, the fact that they can be parallelized will be nice to leverage at the right time.
-viral On Thursday, July 24, 2014 11:36:59 PM UTC+5:30, Kevin Squire wrote: > > Dear Ed, > > Thank you for announcing this! I don't have any projects right now > that need permutations, but I have in the past, and while there is some > support for permutations in mainline Julia, permutations as a data type are > definitely useful! > > I'm wondering if you're interested in creating an official package out of > this? It would require a few small changes to follow Julia conventions, > but would make it easier for people to test. What do you think? > > Cheers! > Kevin > > On Thursday, July 24, 2014, Ed Scheinerman <[email protected]> > wrote: > >> Dear all, >> >> I've created a Permutation data type for Julia. A Permutation object >> represents a permutation of a finite set of the form {1,2,...,n}. >> Operations include composition and inverses. Output is in disjoint cycle >> format. I hope someone finds this useful. >> >> It's available for download from github: >> >> https://github.com/scheinerman/Permutation.git >> >> but all you need is the file "permutation.jl" (attached) and the brief >> instructions "permutation.pdf" (also attached). >> >> -Ed Scheinerman >> >> >>
