* remaining portions of the strings are of equal length. There
* are (n - 1) characters in the target string, of which j have
* been transformed. There are (m - 1) characters in the source
- * string, so we want to find the value for zp where where (n - 1)
- * - j = (m - 1) - zp.
+ * string, so we want to find the value for zp where (n - 1) - j =
+ * (m - 1) - zp.
*/
int zp = j - (n - m);
px_crypt_md5(const char *pw, const char *salt, char *passwd, unsigned dstlen)
{
static char *magic = "$1$"; /* This string is magic for this algorithm.
- * Having it this way, we can get get better
+ * Having it this way, we can get better
* later on */
static char *p;
static const char *sp,
List *prsoptions = (List *) PG_GETARG_POINTER(1);
TSQuery query = PG_GETARG_TSQUERY(2);
- /* from opt + start and and tag */
+ /* from opt + start and end tag */
int min_words = 15;
int max_words = 35;
int shortword = 3;