Lines Matching refs:That
750 // The case of n == 3 should never happen but is included so that modQToMod3
786 that we can exploit to speed this up:
796 // Next define the overbar operator such that z? = z[0] +
801 // A less odd way to define this is to see that z? negates the indexes,
804 // The use of z? is that, when working mod (?^701 - 1), vz[0] = <v,
808 // (That's because (?^N - 1) is a multiple of ?(N).)
863 // Handle the fact that the three-element pattern doesn't fill the
874 // fact that the pattern repeats every three cycles and the pattern of
918 // This algorithm follows algorithm 10 in the paper. (Although note that
970 // page of the PDF linked below. (Although note that the paper appears
