search for: multiword

Hi, I would like to write a search engine for a site, with real-time spell checking. So i need to pass the word beign written atm, not the full field value. If the user clicks one of the suggested words, only the last word should be replaced, not the entire content. Is there any way of doing this? Thanks. -------------- next part -------------- An HTML attachment was scrubbed... URL:

I am using synoyms and cannot determine how to use them in following example: $db->add_synonym('Zfoobar','Zfoo Zbar') or $db->add_synonym('Zfoobar','Zfoo AND Zbar') Or is this general not possible? MfG Felix

I'm trying to work out LLVM code which generates something similar to the following when adding large multiword numbers stored as separate words: ADD x1 x1 ADC x2 y2 ADC x3 y3 etc, where such a three argument add like ADC on x86 (which includes a carry in the addition) is available as a machine op. The background to this is that I'm trying to implement fast multiword addition in Haskell, which can com...

I'm working on a Target that only uses the 5 lsbs of the shift amount. I only have 32 bit registers, no 64 bit, so 64 bit math is emulated, LLVM doing the transformations whenever I can get it to. I think I'm seeing a case where it ultimately looks like a standard multiword shift (from e.g. Hacker's Delight) is being inline expanded that assumes at least 6 bits of the shift is paid attention to (i.e. it looks like it assumes x >> 32 == 0 if x is 32 bits, but for me x >> 32 == x). (A) What does LLVM assume about "shift width"? (B) Is th...

...ft amount. Okay, that's quite common... x86 is the same. > I only have 32 bit registers, no 64 bit, so 64 bit math is emulated, > LLVM doing the transformations whenever I can get it to. x86 is the same. > I think I'm seeing a case where it ultimately looks like a standard > multiword shift (from e.g. Hacker's Delight) is being inline expanded > that assumes at least 6 bits of the shift is paid attention to (i.e. > it looks like it assumes x >> 32 == 0 if x is 32 bits, but for me x >> > 32 == x). > > (A) What does LLVM assume about "shift widt...

...ported by Julien Cristau <jcristau at debian.org> Eamon Walsh (14): Add XML description for XInput extension. Add XML description for SELinux extension. xcb-xselinux: Remove an errant padding statement. xcb-xselinux: Revisions to xselinux extension protocol. Use multiword attribute instead of oneword in XSELinux description. Xinerama GetScreenSize screen field is a CARD32, not an xproto screen struct. Remove some stray padding from an XInput request. Require a length specification for lists in reply structures. Add Python parser language-inde...

...s page that I could identify with. To summarize, in the project, I used libxml++ to parse the wiki dump. I built an index of words (using multi-way merge) along with its posting list in the decreasing order of TF-IDF. And then built a secondary index on top of it for fast retrieval. To search for multiword queries, I used a simple ? tf-idf ranking system. I would like to apply for GSoC 2014 as well and Xapian seems a great place to learn more and put in practice the theories I am learning in my Information Retrieval and Extraction course. How would you suggest I should proceed? Thanks. Nikhar ----...

The comment says it was added due to a bug in MSVC 2013 implementation of stable_sort. Newer versions of MSVC have fixed this bug in stable_sort according to this webpage record https://connect.microsoft.com/VisualStudio/feedback/details/886652 Can we remove the check now? ~Craig -------------- next part -------------- An HTML attachment was scrubbed... URL:

...ormations whenever I can get it to. > > x86 is the same. Ah, maybe I should try my test below on x86, and see what happens. It'll take me a bit as I'm not familiar with x86 assembly code. > >> I think I'm seeing a case where it ultimately looks like a standard >> multiword shift (from e.g. Hacker's Delight) is being inline expanded >> that assumes at least 6 bits of the shift is paid attention to (i.e. >> it looks like it assumes x >> 32 == 0 if x is 32 bits, but for me x >> >> >> 32 == x). >> >> (A) What does LLV...

Hi, Is the http://xenbits.xensource.com/linux-2.6-xen.hg tree still being updated? if not, what''s the preferred Linux tree to track that has all of the Xen bits? Thanks, Muli _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel