t
--------------------------------
1
+ 1.1
+ 1.1.1
+ 1.1.1.1
+ 1.1.1.2.1
+ 1.1.2.1
+ 1.26.15.23.5.31.29.11.19.28.1
+ 10.13.22.1.8.30.9.24.1.2.1
10.22.1
10.26.30.15.1
11.1
+ 12.1.1
17.25.2.13.10.27.13.1
18.13.6.12.26.26.26.29.18.20.1
19.20.25.7.27.28.27.17.9.3.1
21.18.2.1
21.23.17.8.23.11.8.1
22.30.31.24.23.22.5.20.28.1
+ 23.17.22.1.23.4.29.32.4.1
23.28.1
23.3.32.21.5.14.10.17.1
25.6.12.16.1
8.2.18.23.5.16.17.1
8.32.30.1
9.21.20.29.1
-(25 rows)
+(34 rows)
SELECT * FROM ltreetest WHERE t ~ '23.*.1' order by t asc;
- t
--------------------------
+ t
+---------------------------
+ 23.17.22.1.23.4.29.32.4.1
23.28.1
23.3.32.21.5.14.10.17.1
-(2 rows)
+(3 rows)
SELECT * FROM ltreetest WHERE t ~ '23.*{1}.1' order by t asc;
t
t
--------------------------------
1
+ 1.1
+ 1.1.1
+ 1.1.1.1
+ 1.1.1.2.1
+ 1.1.2.1
+ 1.26.15.23.5.31.29.11.19.28.1
+ 10.13.22.1.8.30.9.24.1.2.1
10.22.1
10.26.30.15.1
11.1
+ 12.1.1
17.25.2.13.10.27.13.1
18.13.6.12.26.26.26.29.18.20.1
19.20.25.7.27.28.27.17.9.3.1
21.18.2.1
21.23.17.8.23.11.8.1
22.30.31.24.23.22.5.20.28.1
+ 23.17.22.1.23.4.29.32.4.1
23.28.1
23.3.32.21.5.14.10.17.1
25.6.12.16.1
8.2.18.23.5.16.17.1
8.32.30.1
9.21.20.29.1
-(25 rows)
+(34 rows)
SELECT * FROM ltreetest WHERE t ~ '23.*.1' order by t asc;
- t
--------------------------
+ t
+---------------------------
+ 23.17.22.1.23.4.29.32.4.1
23.28.1
23.3.32.21.5.14.10.17.1
-(2 rows)
+(3 rows)
SELECT * FROM ltreetest WHERE t ~ '23.*{1}.1' order by t asc;
t
SELECT count(*) FROM _ltreetest WHERE t ~ '*.1' ;
count
-------
- 83
+ 109
(1 row)
SELECT count(*) FROM _ltreetest WHERE t ~ '23.*.1' ;
count
-------
- 10
+ 11
(1 row)
SELECT count(*) FROM _ltreetest WHERE t ~ '23.*{1}.1' ;
SELECT count(*) FROM _ltreetest WHERE t ~ '*.1' ;
count
-------
- 83
+ 109
(1 row)
SELECT count(*) FROM _ltreetest WHERE t ~ '23.*.1' ;
count
-------
- 10
+ 11
(1 row)
SELECT count(*) FROM _ltreetest WHERE t ~ '23.*{1}.1' ;
}
bool
- compare_subnode(ltree_level * t, char *qn, int len, int (*cmpptr) (const char *, const char *, size_t), bool anyend)
+compare_subnode(ltree_level * t, char *qn, int len, int (*cmpptr) (const char *, const char *, size_t), bool anyend)
{
char *endt = t->name + t->len;
char *endq = qn + len;
}
*/
+static struct {
+ bool muse;
+ uint32 high_pos;
+} SomeStack = {false,0,};
+
static bool
checkCond(lquery_level * curq, int query_numlevel, ltree_level * curt, int tree_numlevel, FieldNot * ptr)
{
lquery_level *prevq = NULL;
ltree_level *prevt = NULL;
+ if ( SomeStack.muse ) {
+ high_pos = SomeStack.high_pos;
+ qlen--;
+ prevq = curq;
+ curq = LQL_NEXT(curq);
+ SomeStack.muse = false;
+ }
+
while (tlen > 0 && qlen > 0)
{
if (curq->numvar)
curt = LEVEL_NEXT(curt);
tlen--;
cur_tpos++;
+ if ( isok && prevq && prevq->numvar==0 && tlen>0 && cur_tpos <= high_pos ) {
+ FieldNot tmpptr;
+ if ( ptr )
+ memcpy(&tmpptr,ptr,sizeof(FieldNot));
+ SomeStack.high_pos = high_pos-cur_tpos;
+ SomeStack.muse = true;
+ if ( checkCond(prevq, qlen+1, curt, tlen, (ptr) ? &tmpptr : NULL) )
+ return true;
+ }
if (!isok && ptr)
ptr->nt++;
}