Index Cond: (a @@ '''ever'' | ''wrote'''::tsquery)

(5 rows)

explain (costs off)

SELECT * FROM test_rum WHERE a @@ to_tsquery('pg_catalog.english', 'ever|wrote')

ORDER BY a >< to_tsquery('pg_catalog.english', 'ever|wrote');

QUERY PLAN

------------------------------------------------------------------

Sort

Sort Key: ((a >< '''ever'' | ''wrote'''::tsquery))

-> Bitmap Heap Scan on test_rum

Recheck Cond: (a @@ '''ever'' | ''wrote'''::tsquery)

-> Bitmap Index Scan on rumidx

Index Cond: (a @@ '''ever'' | ''wrote'''::tsquery)

(6 rows)

SELECT count(*) FROM test_rum WHERE a @@ to_tsquery('pg_catalog.english', 'ever|wrote');

count

-------

2

(1 row)

SELECT rum_ts_distance(a, to_tsquery('pg_catalog.english', 'way')), *

FROM test_rum

WHERE a @@ to_tsquery('pg_catalog.english', 'way')

ORDER BY a >< to_tsquery('pg_catalog.english', 'way');

rum_ts_distance | t | a

-----------------+--------------------------------------------------------------------------+---------------------------------------------------------------

16.4493 | my appreciation of you in a more complimentary way than by sending this | 'appreci':2 'complimentari':8 'send':12 'way':9

16.4493 | itself. Put on your “specs” and look at the castle, half way up the | 'castl':10 'half':11 'look':7 'put':2 'spec':5 'way':12

16.4493 | so well that only a fragment, as it were, gave way. It still hangs as if | 'fragment':6 'gave':10 'hang':14 'still':13 'way':11 'well':2

16.4493 | thinking--“to go or not to go?” We are this far on the way. Reached | 'far':11 'go':3,7 'reach':15 'think':1 'way':14

(4 rows)

-- CRASHES

--SELECT rum_ts_distance(a, to_tsquery('pg_catalog.english', 'way & (go | half)')), *

--FROM test_rum

--WHERE a @@ to_tsquery('pg_catalog.english', 'way & (go | half)')

--ORDER BY a >< to_tsquery('pg_catalog.english', 'way & (go | half)');

INSERT INTO test_rum (t) VALUES ('foo bar foo the over foo qq bar');

INSERT INTO test_rum (t) VALUES ('345 qwerty copyright');

INSERT INTO test_rum (t) VALUES ('345 qwerty');

item->data[j]=keyGetOrdering(&so->rumstate,so->tempCtx,&so->keys[i],&so->iptr);

j++;

}

tuplesort_putrum(so->sortstate,item);

rum_tuplesort_putrum(so->sortstate,item);

}

so->tbm=NULL;

so->entriesIncrIndex=-1;

so->firstCall= false;

so->sortstate=tuplesort_begin_rum(work_mem,so->norderbys, false);

so->sortstate=rum_tuplesort_begin_rum(work_mem,so->norderbys, false);

scanPendingInsert(scan);

{

insertScanItem(so,recheck);

}

tuplesort_performsort(so->sortstate);

rum_tuplesort_performsort(so->sortstate);

}

item=tuplesort_getrum(so->sortstate, true,&should_free);

item=rum_tuplesort_getrum(so->sortstate, true,&should_free);

if (item)

{

scan->xs_ctup.t_self=item->iptr;

freeScanKeys(so);

if (so->sortstate)

tuplesort_end(so->sortstate);

rum_tuplesort_end(so->sortstate);

MemoryContextDelete(so->tempCtx);