| /dports/textproc/redisearch/RediSearch-2.2.5/tests/cpptests/ |
| H A D | test_cpp_extensions.cpp | 138 ASSERT_EQ(QN_UNION, n->children[0]->type); in TEST_F()
146 ASSERT_EQ(QN_UNION, n->children[1]->type); in TEST_F()
|
| H A D | test_cpp_query.cpp | 221 ASSERT_TRUE(n->children[0]->type == QN_UNION); in TEST_F()
|
| H A D | test_cpp_index.cpp | 292 IndexIterator *ui = NewUnionIterator(irs, 2, NULL, 0, 1, QN_UNION, NULL); in TEST_F()
331 IndexIterator *ui = NewUnionIterator(irs, 2, NULL, 0, 0.8, QN_UNION, NULL); in TEST_F()
|
| /dports/textproc/redisearch20/RediSearch-2.0.15/tests/cpptests/ |
| H A D | test_cpp_extensions.cpp | 138 ASSERT_EQ(QN_UNION, n->children[0]->type); in TEST_F()
146 ASSERT_EQ(QN_UNION, n->children[1]->type); in TEST_F()
|
| H A D | test_cpp_query.cpp | 221 ASSERT_TRUE(n->children[0]->type == QN_UNION); in TEST_F()
|
| /dports/textproc/redisearch16/RediSearch-1.6.16/src/cpptests/ |
| H A D | t_extensions.cpp | 137 ASSERT_EQ(QN_UNION, n->children[0]->type); in TEST_F()
145 ASSERT_EQ(QN_UNION, n->children[1]->type); in TEST_F()
|
| H A D | t_query.cpp | 221 ASSERT_TRUE(n->children[0]->type == QN_UNION); in TEST_F()
|
| /dports/textproc/redisearch/RediSearch-2.2.5/src/ |
| H A D | extension.c | 154 if (qn->type != QN_UNION) { in Ext_ExpandToken()
193 if (qn->type != QN_UNION) { in Ext_ExpandTokenWithPhrase()
|
| H A D | query_internal.h | 56 #define NewUnionNode() NewQueryNode(QN_UNION)
|
| H A D | query_node.h | 18 QN_UNION, enumerator
|
| H A D | query.c | 84 case QN_UNION: in QueryNode_Free()
234 } else if (qn->type == QN_UNION || in QueryNode_Expand()
537 if (qn->type != QN_UNION) { in Query_EvalUnionNode()
567 IndexIterator *ret = NewUnionIterator(iters, n, q->docTable, 0, qn->opts.weight, QN_UNION, NULL); in Query_EvalUnionNode()
792 case QN_UNION: in Query_EvalNode()
1033 case QN_UNION: in QueryNode_DumpSds()
|
| H A D | redisearch_api.c | 388 return NewQueryNode(QN_UNION); in RediSearch_CreateUnionNode()
|
| /dports/textproc/redisearch20/RediSearch-2.0.15/src/ |
| H A D | extension.c | 154 if (qn->type != QN_UNION) { in Ext_ExpandToken()
193 if (qn->type != QN_UNION) { in Ext_ExpandTokenWithPhrase()
|
| H A D | query_internal.h | 56 #define NewUnionNode() NewQueryNode(QN_UNION)
|
| H A D | query_node.h | 18 QN_UNION, enumerator
|
| H A D | query.c | 87 case QN_UNION: in QueryNode_Free()
237 } else if (qn->type == QN_UNION || in QueryNode_Expand()
539 if (qn->type != QN_UNION) { in Query_EvalUnionNode()
784 case QN_UNION: in Query_EvalNode()
1026 case QN_UNION: in QueryNode_DumpSds()
|
| H A D | redisearch_api.c | 377 return NewQueryNode(QN_UNION); in RediSearch_CreateUnionNode()
|
| /dports/textproc/redisearch16/RediSearch-1.6.16/src/ |
| H A D | extension.c | 154 if (qn->type != QN_UNION) { in Ext_ExpandToken()
193 if (qn->type != QN_UNION) { in Ext_ExpandTokenWithPhrase()
|
| H A D | query_internal.h | 56 #define NewUnionNode() NewQueryNode(QN_UNION)
|
| H A D | query_node.h | 18 QN_UNION, enumerator
|
| H A D | query.c | 86 case QN_UNION: in QueryNode_Free()
236 } else if (qn->type == QN_UNION || in QueryNode_Expand()
541 if (qn->type != QN_UNION) { in Query_EvalUnionNode()
767 case QN_UNION: in Query_EvalNode()
1009 case QN_UNION: in QueryNode_DumpSds()
|
| H A D | redisearch_api.c | 296 return NewQueryNode(QN_UNION); in RediSearch_CreateUnionNode()
|
| /dports/textproc/redisearch20/RediSearch-2.0.15/src/query_parser/ |
| H A D | parser.y | 209 if (B->type == QN_UNION && B->opts.fieldMask == RS_FIELDMASK_ALL) { in expr()
|
| /dports/textproc/redisearch/RediSearch-2.2.5/src/query_parser/ |
| H A D | parser.y | 209 if (B->type == QN_UNION && B->opts.fieldMask == RS_FIELDMASK_ALL) { in expr()
|
| /dports/textproc/redisearch16/RediSearch-1.6.16/src/query_parser/ |
| H A D | parser.y | 209 if (B->type == QN_UNION && B->opts.fieldMask == RS_FIELDMASK_ALL) { in expr()
|