similar to: some trouble when devising skiplist

On Mon, Dec 6, 2010 at 6:16 PM, Villmow, Micah <Micah.Villmow at amd.com> wrote: >> -----Original Message----- >> From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] >> On Behalf Of Peter Collingbourne >> Sent: Monday, December 06, 2010 2:56 PM >> To: David Neto >> Cc: cfe-dev at cs.uiuc.edu; llvmdev at cs.uiuc.edu >>

Mike Hommey <mh at glandium.org> writes: > Hi, > > When running `notmuch compact` today, it stopped with the following > output: > > Compacting database... > compacting table postlist > Reduced by 25% 648656K (2498904K -> 1850248K) > compacting table docdata > Reduced by 15% 24K (152K -> 128K) > compacting table termlist > Reduced by

> -----Original Message----- > From: David Neto [mailto:dneto.llvm at gmail.com] > Sent: Tuesday, December 07, 2010 1:03 PM > To: Villmow, Micah > Cc: cfe-dev at cs.uiuc.edu; llvmdev at cs.uiuc.edu > Subject: Re: [cfe-dev] [LLVMdev] OpenCL support > > On Mon, Dec 6, 2010 at 6:16 PM, Villmow, Micah <Micah.Villmow at amd.com> > wrote: > >> -----Original

On Thu, Dec 04, 2014 at 08:28:32PM -0500, Manu Gupta wrote: > I was trying to build Han's code and was stuck here. It seems to me that > his code is trying to generate pdf for them. > > Is it possible to modify the make files to stop building the documentation. You can run the top-level configure with --disable-documentation. Cheers, Olly

I've gone over and over the man page and I don't get it and it's obviously a simple task I want to rsync a directory but only the pdf files... rsync -ncauv --include=*.pdf $WORKING $WEB_SERVER # sync's everything, I want to exclude stuff rsync -ncauv --filter='+ *.pdf' --filter='+ *.odt *.ott *.eps' \ $WORKING $WEB_SERVER # sync's everything...does not seem

Hi Maybe I can start off with Hanxiao's branch but I can see there are two repos. https://github.com/v-hasu/xapian/tree/gsoc2014-evaluation https://github.com/v-hasu/xapian/tree/gsoc2014 which one should I pick? I have already successfully built xapian from the git repository ( https://github.com/xapian/xapian) Since I am new to ML (well I dont know anything about it?), should I read the

Hi, I encountered a problem about volatile quantifier when using llvm-gcc, here is the example: #define N 10 int sum(volatile int a[N]) { int sum = 0; unsigned i = 0; for (i = 0; i < N; ++i) sum += a[i]; return sum; } If I compile it as C code, then llvm-gcc will dump: define i32 @sum(i32* nocapture %a) nounwind { bb1.thread: %0 = volatile load i32* %a, align 4

> -----Original Message----- > From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] > On Behalf Of Peter Collingbourne > Sent: Monday, December 06, 2010 2:56 PM > To: David Neto > Cc: cfe-dev at cs.uiuc.edu; llvmdev at cs.uiuc.edu > Subject: Re: [LLVMdev] [cfe-dev] OpenCL support > > Hi David, > > On Mon, Dec 06, 2010 at 11:14:42AM -0500,

I'd suggest that a good thing to look at would be functional tests of the metrics and algorithms in Hanxiao Sun's work from this summer. You'll generally need to go either to the original paper, or find an alternative implementation, to build up a series of tests that demonstrate that the implementation is doing what it is supposed to. Xapian-core contains a test framework which it

Sorry if this is the wrong forum to discuss Search::Xapian issues -- this just seems like the best place.. Anyways, I've been testing out using $db->add_database() when searching, and it seems like the docids I'm getting out of it are incorrect, almost as though they're "double" what they should be (numerically)... the docids that exist should be around 950,000 and

Hi David, On Mon, Dec 06, 2010 at 11:14:42AM -0500, David Neto wrote: > >> It > >> seems it would be a good idea to transform the code so that uses of x > >> become loads and stores from memory, and the address for that memory > >> is returned by a builtin function that itself is dependent on work > >> group ids. > >> > >> I'm

This looks wrong to me, though the x86 backend produces code that does the right thing (reads each element once). If you change the code (see below) to read each element twice, llvm-gcc still does the right thing but llvm-g++ does not (i.e. it fails to read aech location twice). Current versions of gcc/g++ also look wrong. All 4 compilers (gcc,g++,llvm-gcc,llvm-g++) do the right thing when

Hi Olly I will try to work on : http://trac.xapian.org/wiki/GSoCProjectIdeas#Project:LearningtoRank I will be taking a Machine Learning class the next semester and I hope that this project will help me supplement my learning in Machine Learning and also gain a bit of knowledge in IR. If you can give me ideas on how to get around with the code for LTR project, it will be awesome. I can look at

Hi Xapianers: My name is Weixian Zhou, Computer Science student of University at Buffalo, State University of New York. I am interested in the project of posting list encoding improvements and weighting schemes. I have some questions toward them. 1) After read the comments in brass_postlist.cc, I am still not very clear about the detailed structure of postings list. If you can provide some simple

Hi, I'm trying to use custom weight with python binding. My test code is like this. class TinkerWeight(xapian.Weight): def __init__(self): pass def name(self): return "Tinker" def serialize(self): return "" def get_sumpart(*args): return 1 def get_maxpart(*args): return 1 def get_sumextra(*args):

Am 12.08.2015 um 20:29 schrieb Dr J Austin: > > > On Wed, 12 Aug 2015, Alexander Dalloz wrote: > > >>> I have been working at trying to get cyrus to listen on 148.197.29.5 >>> interface instead of the localhost - I have failed >>> > >> No square brackets around the ip address. > > imap cmd="imapd" listen="imap"

Just a quick question - it seems to me that it's entirely possible to get overlapping docids when searching on multiple databases? For instance: open database1 add database2 to database1 search db1+db2 if docid 10 exists in both databases, is there any way of telling which which database to retrieve the document from? /Per Jessen, Z?rich

On Wed, May 03, 2023 at 12:38:15PM +0000, Eric Wong wrote: > Olly Betts <olly at survex.com> wrote: > > This will also effectively ignore boolean terms, assuming you're giving > > them wdf of 0 (because $3 here is the collection frequency, which is > > sum(wdf(term)) over all documents). > > Should boolean terms be ignored when estimating flushing >

Hi James, > ID: some identifier for each query > QUERY: text of the query (when the query is run) > URLs: every URL displayed (or alternatively, the Xapian docid — this > might be easier) > OFFSET: otherwise you'll have difficulty coping with result pages other > than the first page (when this happens, the query ID should probably > remain the same, and when you aggregate

On Wed, Jun 19, 2013, at 03:49 PM, Olly Betts wrote: > On Wed, Jun 19, 2013 at 01:29:16PM +1000, Bron Gondwana wrote: > > The advantage of compact - it runs approximately 8 times as fast (we > > are CPU limited in each case - writing to tmpfs first, then rsyncing > > to the destination) and it takes approximately 75% of the space of a > > fresh database with maximum