Examples of org.joni.ast.StringNode

org.joni.ast.StringNode

        if (sn.length() <= 0) return;
        addCompileString(sn.bytes, sn.p, 1 /*sb*/, sn.length(), false);
    }


    private void compileStringNode(StringNode node) {
        StringNode sn = node;
        if (sn.length() <= 0) return;


        boolean ambig = sn.isAmbig();


        int p, prev;
        p = prev = sn.p;
        int end = sn.end;
        byte[]bytes = sn.bytes;

View Full Code Here

        case NodeType.ALT:
            compileAltNode((ConsAltNode)node);
            break;


        case NodeType.STR:
            StringNode sn = (StringNode)node;
            if (sn.isRaw()) {
                compileStringRawNode(sn);
            } else {
                compileStringNode(sn);
            }
            break;

View Full Code Here

                }
            }
            break;


        case NodeType.STR:
            StringNode sn = (StringNode)node;
            len = sn.length(enc);
            break;


        case NodeType.QTFR:
            QuantifierNode qn = (QuantifierNode)node;
            if (qn.lower == qn.upper) {

View Full Code Here


            } // inner switch
            break; // case NodeType.CCLASS


        case NodeType.STR:
            StringNode xs = (StringNode)x;
            if (xs.length() == 0) break;


            switch (yType) {
            case NodeType.CTYPE:
                CTypeNode cy = ((CTypeNode)y);
                switch (cy.ctype) {
                case CharacterType.WORD:
                    if (enc.isMbcWord(xs.bytes, xs.p, xs.end)) {
                        return cy.not;
                    } else {
                        return !cy.not;
                    }


                default:
                    break;


                } // inner switch
                break;


            case NodeType.CCLASS:
                CClassNode cc = (CClassNode)y;
                int code = enc.mbcToCode(xs.bytes, xs.p, xs.p + enc.maxLength());
                return !cc.isCodeInCC(enc, code);


            case NodeType.STR:
                StringNode ys = (StringNode)y;
                int len = xs.length();
                if (len > ys.length()) len = ys.length();
                if (xs.isAmbig() || ys.isAmbig()) {
                    /* tiny version */
                    return false;
                } else {
                    for (int i=0, p=ys.p, q=xs.p; i<len; i++, p++, q++) {
                        if (ys.bytes[p] != xs.bytes[q]) return true;

View Full Code Here

        case NodeType.LIST:
            n = getHeadValueNode(((ConsAltNode)node).car, exact);
            break;


        case NodeType.STR:
            StringNode sn = (StringNode)node;
            if (sn.end <= sn.p) break; // ???


            if (exact && !sn.isRaw() && isIgnoreCase(regex.options)){
                // nothing
            } else {
                n = node;
            }
            break;

View Full Code Here

        int type = node.getType();
        if (type == NodeType.QTFR) {
            QuantifierNode qn = (QuantifierNode)node;
            if (qn.greedy && isRepeatInfinite(qn.upper)) {
                if (Config.USE_QTFR_PEEK_NEXT) {
                    StringNode n = (StringNode)getHeadValueNode(nextNode, true);
                    /* '\0': for UTF-16BE etc... */
                    if (n != null && n.bytes[n.p] != 0) { // ?????????
                        qn.nextHeadExact = n;
                    }
                } // USE_QTFR_PEEK_NEXT

View Full Code Here

            sp += len;
        }
    }


    private void updateStringNodeCaseFold(Node node) {
        StringNode sn = (StringNode)node;
        byte[] toLower = enc.toLowerCaseTable();
        if (toLower != null) {
            updateStringNodeCaseFoldSingleByte(sn, toLower);
        } else {
            updateStringNodeCaseFoldMultiByte(sn);

View Full Code Here

            updateStringNodeCaseFoldMultiByte(sn);
        }
    }


    private Node expandCaseFoldMakeRemString(byte[]bytes, int p, int end) {
        StringNode node = new StringNode(bytes, p, end);


        updateStringNodeCaseFold(node);
        node.setAmbig();
        node.setDontGetOptInfo();
        return node;
    }

View Full Code Here

            listNode.setCar(altNode);
        } else {
            node.p = altNode = newAltNode(null, null);
        }


        StringNode snode = new StringNode(bytes, p, p + slen);
        altNode.setCar(snode);


        for (int i=0; i<itemNum; i++) {
            snode = new StringNode();


            for (int j = 0; j < items[i].codeLen; j++) snode.catCode(items[i].code[j], enc);


            ConsAltNode an = newAltNode(null, null);
            if (items[i].byteLen != slen) {
                int q = p + items[i].byteLen;
                if (q < end) {

View Full Code Here

        return varlen;
    }


    private static final int THRESHOLD_CASE_FOLD_ALT_FOR_EXPANSION = 8;
    private Node expandCaseFoldString(Node node) {
        StringNode sn = (StringNode)node;


        if (sn.isAmbig() || sn.length() <= 0) return node;


        byte[]bytes = sn.bytes;
        int p = sn.p;
        int end = sn.end;
        int altNum = 1;


        ConsAltNode topRoot = null, root = null;
        ObjPtr<Node> prevNode = new ObjPtr<Node>();
        StringNode stringNode = null;


        while (p < end) {
            CaseFoldCodeItem[]items = enc.caseFoldCodesByString(regex.caseFoldFlag, bytes, p, end);
            int len = enc.length(bytes, p, end);


            if (items.length == 0) {
                if (stringNode == null) {
                    if (root == null && prevNode.p != null) {
                        topRoot = root = ConsAltNode.listAdd(null, prevNode.p);
                    }


                    prevNode.p = stringNode = new StringNode(); // onig_node_new_str(NULL, NULL);


                    if (root != null) ConsAltNode.listAdd(root, stringNode);


                }


                stringNode.cat(bytes, p, p + len);
            } else {
                altNum *= (items.length + 1);
                if (altNum > THRESHOLD_CASE_FOLD_ALT_FOR_EXPANSION) break;


                if (root == null && prevNode.p != null) {

View Full Code Here

0 1

TOP

Related Classes of org.joni.ast.StringNode

org.joni.Analyser

org.joni.ApplyCaseFold

org.joni.ArrayCompiler

org.joni.Compiler

org.joni.Parser

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.