I was thinking of dynamically building up the strings using the `nextchar`
extension but your example works just fine.
On Fri, Sep 18, 2015 at 9:52 AM, Igor Tandetnik wrote:
> On 9/18/2015 9:05 AM, Charles Leifer wrote:
>
>> As a challenge I was curious how one would write a recursive CTE to
On 9/18/2015 9:05 AM, Charles Leifer wrote:
> As a challenge I was curious how one would write a recursive CTE to take a
> substring and recursively calculate all possible matches. I realize I could
> just use 'LIKE xxx%' to accomplish the same, but if anyone has any thoughts
> on writing such a
I've been playing around a bit with the `nextchar` extension and I must say
it's pretty neat! Basically I create a table named `words` with a single
TEXT column named `word` and populate it with a dictionary file. Then I can
run:
SELECT nextchar('partial word', 'words', 'word');
And it will
3 matches
Mail list logo
