Features

Added Yuta Mori's induced sort
Added the option to select a SuffixSort algorithm
Replaced WriteInt64 with a faster method
Bradley,

SAIS-CSharp is the work of Yuta Mori (
https://sites.google.com/site/yuta256/sais) and I have included it without
changing the implementation, as an example of an interchangeable suffix
sort that works within bsdiff.net.


On Tue, Jul 22, 2014 at 9:26 AM, Bradley Grainger <notifications@github.com>
wrote:

> In src/bsdiff/SAIS.cs:
>
> > +                    SA[0] = 0;
> > +                }
> > +                return 0;
> > +            }
> > +            return sais_main(new ByteArray(T, 0), SA, 0, n, 256, false);
> > +        }
> > +
> > +        /* char */
> > +        /// <summary>
> > +        /// Constructs the suffix array of a given string in linear time.
> > +        /// </summary>
> > +        /// <param name="T">input string</param>
> > +        /// <param name="SA">output suffix array</param>
> > +        /// <param name="n">length of the given string</param>
> > +        /// <returns>0 if no error occurred, -1 or -2 otherwise</returns>
> > +        public static int sufsort(char[] T, int[] SA, int n)
>
> Are these (and the following overloads) ever called? Seems like
> unnecessary code.
>
> —
> Reply to this email directly or view it on GitHub
> <https://github.com/LogosBible/bsdiff.net/pull/3/files#r15230354>.
>