CONTIGUOUS
} else if ((code & ~CONTIGUOUS) == 0) {
if (likely((classify[ (uint8_t)*start ] & ~CONTIGUOUS) == 0)) {
if (n != 3 || p == g || p - g > 4 || classify[(uint8_t)*p] == CONTIGUOUS)
return token->code == CONTIGUOUS;
return (token->code == CONTIGUOUS || token->code == QUOTED);
if (likely(token->code == CONTIGUOUS)) {
if (likely(token->code == CONTIGUOUS)) {
assert(token->code != CONTIGUOUS);
if (unlikely(token->code != CONTIGUOUS))
assert(token->code != CONTIGUOUS);
if (likely(token->code == CONTIGUOUS)) {
if (unlikely(token->code != CONTIGUOUS))
if (token->code == CONTIGUOUS)
} else if (token->code == CONTIGUOUS) {
if (unlikely(token->code != CONTIGUOUS))
if (likely(token->code == CONTIGUOUS)) {
if (likely(token->code == CONTIGUOUS)) {
assert(token->code == CONTIGUOUS || token->code == QUOTED);
assert(token->code == CONTIGUOUS || token->code == QUOTED);