similar to: java-swig TermIterator

Hi, I'm using xapian with c# and mono and i'm having a segfault in get_weight. When i print the index variable, the value is clearly too high. I think something write over it. Do you have any idea on how i could trace the beginning of the segmentation fault ? Thanks, -- Yann

Hi, While porting the unit tests from perl for the node binding I noticed a test failed. I basically create a document, add a few terms, add the document to a database and then call doc->termlist_begin().get_termfreq(). This throws "Can't get term frequency from a document termlist which is not associated with a database." What I think this means is that I can not call

Hi all, I've been toying with xapian (mostly using the Python bindings) and I think I've hit a bug in the TermIterator::skip_to() method (or maybe in QuartzAllTermsList::skip_to()). I've attached a c++ source file that demonstrates the issue. In short, if you have a WritableDatabase, ask for the all-terms TermIterator with db.allterms_begin(), and then skip_to() a word that is itself

On May 12, 2008, at 6:49 PM, Talin wrote: > So the question is, what's the trade-off. In most languages that > support > exceptions, you tend to think of exceptions as expensive operations > that > should only be thrown if something truly "exceptional" happens. OTOH, > the Java case is also made worse by the fact that a large part of the > time you'll be

Hi all, I've tried building RPMs for RHEL5 and hit this problem in Search::Xapian: make test fails on test 37: ok 34 - check PositionIterator ok 35 - create TermIterator ok 36 - check TermIterator dubious Test returned status 0 (wstat 11, 0xb) DIED. FAILED tests 37-65 Failed 29/65 tests, 55.38% okay $ xapian-config --version xapian-config - xapian-core 1.0.4 $ cat

This is related to the general question of efficiency of unwinds. I'm mulling over whether to use the Java-style or Python-style iterator protocol for my language. The Python style is to have a special exception (StopIteration) that is thrown when the end of the sequence is reached. The Java style is to have a separate "hasNext" method on the iterator object that says whether or

On Wed, Aug 23, 2023 at 01:53:27PM +0000, Eric Wong wrote: > I'm already retrying the ->get_mset operations; but now I'm > wondering where I'd hit DatabaseModifiedErrors while inside a > Xapian::MSetIterator loop. > > I assume ->get_document is a place where it gets thrown; > but once a document is retrieved, can iterating through > terms in one document

On May 13, 2008, at 18:28, Dan Gohman wrote: > On May 12, 2008, at 6:49 PM, Talin wrote: > >> So the question is, what's the trade-off. In most languages that >> support exceptions, you tend to think of exceptions as expensive >> operations that should only be thrown if something truly >> "exceptional" happens. OTOH, the Java case is also made

Hello, Consider this : > setClass("track", representation(x="numeric", y="numeric")) [1] "track" > o <- new( "track", x = 1, y = 2 ) > for( i in o ){ + cat( "hello\n") + } Error: invalid type/length (S4/1) in vector allocation This happens at those lines of do_for: n = LENGTH(val); PROTECT_WITH_INDEX(v =

I'm already retrying the ->get_mset operations; but now I'm wondering where I'd hit DatabaseModifiedErrors while inside a Xapian::MSetIterator loop. I assume ->get_document is a place where it gets thrown; but once a document is retrieved, can iterating through terms in one document (using TermIterator) also throw DB modified? I'm dumping multiple terms per-document to a

Olly Betts <olly at survex.com> wrote: > On Wed, Aug 23, 2023 at 01:53:27PM +0000, Eric Wong wrote: > > I'm already retrying the ->get_mset operations; but now I'm > > wondering where I'd hit DatabaseModifiedErrors while inside a > > Xapian::MSetIterator loop. > > > > I assume ->get_document is a place where it gets thrown; > > but

I can't quite connect the dots on this, perhaps someone can help. I'm simply trying to create an in-memory database comprising a single document, so that I can run a load of queries against it and see if any of them match the new document (this is to enable users to have 'subscriptions' to saved searches and be alerted every time a new item is published that matches their

Hello, I have a problem when trying to define a query and setting for each term its "term frequency" with the classical constructor Xapian::Query<http://xapian.org/docs/apidoc/html/classXapian_1_1Query.html#f396e213df0d8bcffa473a75ebf228d6>(const std::string &tname_,

I have download source ?1.10? from the internet and build it into lib Then I create a project as the helpdoc said I using vc2005(vc8) The source in my test project is as follow??copy from the helpdoc? #include <xapian.h> #include <iostream> using namespace std; int main(int argc, char **argv) { // Simplest possible options parsing: we just require three or more

[Replying to xapian-devel, as I think a wider audience would be useful] On Mon, Oct 21, 2013 at 11:24:51PM +0800, jiangwen jiang wrote: > yes, it's less efficient. Lucene database has multiple segments, each > segment can treat as a independent database. The same term may exists in >= > 1 segments. Sorry for taking a while to respond - I've been both busy and mulling this

It was a little over two years ago that I saw Chris give a tech talk on LLVM at Google, and that was when I knew that there was a way that I could actually build the programming language that I'd been thinking about for so long. Well, the compiler is still not done, even though I've been plugging steadily away at it in my free time. However, a lot of progress has been made recently,

2009/9/15 Talin <talin at acm.org>: > For example, here's what the "Iterator" interface looks like: > >   interface Iterator[%T] { >     def next -> T or void; >   } So this would be something like: template <class T> virtual class Iterator { T next(); // or void? }; So the power of having two types of return parameters is that you save function

Morning All, I use scriptindex to build my database and the PHP bindings to pull it all out. Is it possible to have more than one index but select what the bindings search on? So at the moment I index property addresses, I would also like to index property descriptions for more advanced searching but only as an optional extra...probably in an extra search box. Also I would like to analyse the

Greetings. I am trying to list all keys in a java.util.HashMap field. The Java code to do this looks like: # Collection c = hMap.values(); # # //obtain an Iterator for Collection # Iterator itr = c.iterator(); # # //iterate through HashMap values iterator # while(itr.hasNext()) System.out.println(itr.next()); So, I took a stab at the ruby version: # I have a java hashmap called fields

On May 13, 2008, at 4:09 PM, Gordon Henriksen wrote: > On May 13, 2008, at 18:28, Dan Gohman wrote: > >> On May 12, 2008, at 6:49 PM, Talin wrote: >> >>> So the question is, what's the trade-off. In most languages that >>> support exceptions, you tend to think of exceptions as expensive >>> operations that should only be thrown if something truly