We are indexing/searching for long strings, containing separators. htdig breaks these up into tokens and then does a boolean AND on them.
We were testing how many tokens are tolerated before htdig is unable to distinguish between two strings. Tests show that if the string is broken into 14 tokens, it gives a unique result, but if the 15th token differs, then it does not recognise this difference. Can anyone comment on the coded token length of htdig (this for V 3.1.6). Does perchance 3.2 differ in this regard? Apologies if this is a developer question! -- Henry Rzepa. +44 (020) 7594 5774 (Voice); +44 (0870) 132 3747 (eFax); [EMAIL PROTECTED] (iChat) http://www.ch.ic.ac.uk/rzepa/ Dept. Chemistry, Imperial College London, SW7 2AZ, UK. (Voracious anti-spam filter in operation for received email. If expected reply not received, please phone/fax). ------------------------------------------------------- SF email is sponsored by - The IT Product Guide Read honest & candid reviews on hundreds of IT Products from real users. Discover which products truly live up to the hype. Start reading now. http://productguide.itmanagersjournal.com/ _______________________________________________ ht://Dig general mailing list: <[EMAIL PROTECTED]> ht://Dig FAQ: http://htdig.sourceforge.net/FAQ.html List information (subscribe/unsubscribe, etc.) https://lists.sourceforge.net/lists/listinfo/htdig-general
