* Laurent Godard <[EMAIL PROTECTED]> [100605, 18:21]:
> Hi again
>
> i am totally wrong sorry
It's me to be sorry for not being able to figure out what this means ;)
>
> subRegExpressions
> "Number of subexpressions, if it is 0, then no match found; this value
> is 1 for ABSOLUTE and APPROXIMATE match. The start and endOffset are
> always dependent on the search direction. For example: if you search "X"
> in the text "-X-" the offset are: for forward: start = 1, end = 2 for
> backward: start = 2, end = 1 Forward, the startOffset is inclusive, the
> endOffset exclusive. Backward, the startOffset is exclusive, the
> endOffset inclusive.
Up to here it's clear enough (well..., unless sombody asks me to explain
what's the Number of subexpressions (plural than can be either 0 or 1?)
> For regular expressions it can be greater than 1.
> If the value is 1,
> startoffset[0] and endoffset[0]
this starts to be a bit bewildering: why ...[0]?
Do I miss some 'basic' glossary?
> points to the
> matching sub string [*;*] if value is > 1, still startoffset[0] and
> endoffset[0] points to the matching substring for whole regular
> expression startoffset[i] and endoffset[i] points to the matching
> substring of i th matching substring."
And this one sounds completely obscure to me: not even able to put
another *;* somewhere to better reading ;(
BTW, before your suggestion to put:
rank = aSearchResult.SubRegExpressions -1
both start and endoffset evaluated to 0.
Thanks for your time.
Ignorantly yours, ;-)
Ennio.
--
[Perche' usare Win$ozz (dico io) se ..."anche uno sciocco sa farlo. \\?//
Fa' qualche cosa di cui non sei capace!" (diceva Henry Miller) ] (�|�)
[Why use Win$ozz (I say) if ... "even a fool can do that. )=(
Do something you aren't good at!" (as Henry Miller used to say) ]
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
