Lines Matching refs:it
12 it shares no code.
29 // The parser has a very static design, but it will do what is required.
111 The type/size of the value, the score, and if it has an index or not.
112 So you could run more than one query on the same volume, but it might return
113 wrong values when it runs concurrently on another volume.
366 Returns MATCH_OK if it matches, NO_MATCH if not, < 0 if something went
456 // prepare own value for use, if it is possible to convert it
494 // Special case for OP_UNEQUAL - it will always operate through the whole
529 // At this point, fIsPattern is only true if it's a string type, and fOp
541 // B_STRING_TYPE doesn't have a fixed length, so it was set
548 // we do it explicitly, because there can't be keys in the
626 // Although it's quite expensive to open all parents,
627 // it's likely that the application that runs the
629 // to do it for root, either).
699 // if we have a pattern, how much does it help our search?
749 // the max. string in an index, it make sense to have it that way
856 // fIsPattern is only true if it's a string type, and fOp OP_EQUAL, or
1247 // create index on the stack and delete it afterwards