search for: valuerang

...both form design of search engine and code details. ???? however, something make me in a puzzle. ? ?? Take? RefCntBase as an example, it seems that it is a "kernel" of xapian, as many classes inherit from it. But,what is it funtion? why is it so important? ???? Another confusion is about Valuerangeprocess. I really want to make clear differences between valuerange-search and common search in details. I added?? ?? Xapian::DateValueRangeProcessor date_proc(2, true, 1930); ??? qp.add_valuerangeprocessor(&date_proc);?? in my code and my code works well. then, I debug it using gdb. howeve...

...both form design of search engine and code details. ???? however, something make me in a puzzle. ? ?? Take? RefCntBase as an example, it seems that it is a "kernel" of xapian, as many classes inherit from it. But,what is it funtion? why is it so important? ???? Another confusion is about Valuerangeprocess. I really want to make clear differences between valuerange-search and common search in details. I added?? ?? Xapian::DateValueRangeProcessor date_proc(2, true, 1930); ??? qp.add_valuerangeprocessor(&date_proc);?? in my code and my code works well. then, I debug it using gdb. howeve...

QueryParser is great, but I would like to make a query myself, so I can filter results by a specified value (in this case restricting by epoch time after a certain value) My code looks like this, and compiles, and appears like it should work according to the perl source:     my $query = $qp->parse_query($querystr);     if ($datefilter) {         my $filterepoch = time() - ($datefilter

...und which takes a left-hand operand of type 'const unsigned int' (or there is no acceptable conversion) c:\libraries\llvm-2.0\lib\transforms\scalar\predicatesimplifier.cpp(677): could be 'bool `anonymous-namespace'::operator <(const llvm::Value *,const `anonymous-namespace'::ValueRanges::ScopedRange &)' [found using argument- dependent lookup] while trying to match the argument list '(const unsigned int, `anonymous-namespace'::InequalityGraph::Edge)' c:\libraries\llvm-2.0\lib\transforms\scalar\predicatesimplifier.cpp(295) : see reference to...

...: 8 Files=1, Tests=65, 1 wallclock secs ( 0.18 usr 0.01 sys + 0.45 cusr 0.03 csys = 0.67 CPU) Result: FAIL FAIL: t/thread.t ./t/tied.t .. ok All tests successful. Files=1, Tests=22, 1 wallclock secs ( 0.14 usr 0.02 sys + 0.22 cusr 0.01 csys = 0.39 CPU) Result: PASS PASS: t/tied.t ./t/valuerange.t .. ok All tests successful. Files=1, Tests=22, 1 wallclock secs ( 0.14 usr 0.01 sys + 0.26 cusr 0.02 csys = 0.43 CPU) Result: PASS PASS: t/valuerange.t ./t/writabledatabase.t .. 4/35 # Failed test 'check term exists' # at ./t/writabledatabase.t line 72. # Failed test ...

Hi all, I am creating Xapian documents and adding a unix timestamp to each document as a value using the doc.add_value method. When I search my Xapian database, I want the option to only search documents with a timestamp within the last year. Is there a way to search across documents with a value greater than a specified value string? Or is there a better way of doing something like this? Any

...    my $filterepoch = time() - ($datefilter * 60 * 60 * 24); >         my $filterquery = > Xapian::Query->new(OP_VALUE_GE,I_DATE,$filterepoch); I think your issue here is that $filterepoch is a number rather than a string (a Perl scalar can have different representations internally). In t/valuerange.t this testcase works: | ok( $query = Xapian::Query->new(OP_VALUE_GE, 0, "two") ); But if I change that "two" to 2 then I get the same error you report. While such sensitivity to the actual current representation of a scalar isn't very Perl-ish, it does actually indic...

Dear All, Is there an LLVM analysis pass that can, given an LLVM integer value, tell me the minimum and maximum values that the value will be at run-time? Conservative answers are fine, and execution time isn't too important, so the more accurate it is, the better. Thanks in advance. -- John T.

...seem important.Please suggest if you feel it should be included. * * *BRA-KET: *These are bracketed expression.Currently the grammar have rule *BRA expr(E) KET* .so if there will be any scope of bi-grams in query inside BRA-KET it would have been consider while working on internal expression. * * *ValueRange: *No relation with Bi-grams. * * *Love: * *Hate: * Since we are trying to avoid query or have a single term.We can restrain adding them as bi-grams. * * *bool_operator:* https://github.com/sehaj-sk/xapian/blob/mybranch/xapian-core/docs/queryparser_new.rst#boolean-query * * Boolean operator are don...

...d which takes a left-hand operand of type 'const unsigned int' (or there is no acceptable conversion) c:\libraries\llvm-2.0\lib\transforms\scalar\predicatesimplifier.cpp(677) : could be 'bool `anonymous-namespace'::operator <(const llvm::Value *,const `anonymous-namespace'::ValueRanges::ScopedRange &)' [found using argument- dependent lookup] while trying to match the argument list '(const unsigned int, `anonymous-namespace'::InequalityGraph::Edge)' c:\libraries\llvm-2.0\lib\transforms\scalar\predicatesimplifier.cpp(295) : see reference to...

Thanks that helped :). I am still trying to cover add_value some more though since I seem to not understand it totally. I guess it is because I am used to Lucene and Sphinx and Solr and it appears that Xapian seems to attach the type of value stored more on add_value. Like for example I am still a bit confused on how slotno actually works and what it actually is. I think the main thing is

...ial.html glossary.html index.html install.html internals.html intro_ir.html matcherdesign.html overview.html postingsource.html queryparser.html remote.html replication.html scalability.html serialisation.html sorting.html spelling.html stemming.html synonyms.html termgenerator.html tests.html valueranges.html '/root/rpmbuild/BUILDROOT/xapian-core-1.4.15-1.x86_64/usr/share/doc/xapian-core' make[3]: Leaving directory `/root/rpmbuild/BUILD/xapian-core-1.4.15/docs' make[2]: Leaving directory `/root/rpmbuild/BUILD/xapian-core-1.4.15/docs' Making install in tests make[2]: Entering dire...