笙默考试管理系统-MyExamTest----codemirror（36）

本文主要是介绍笙默考试管理系统-MyExamTest----codemirror（36），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

笙默考试管理系统-MyExamTest----codemirror（36）

目录

一、 笙默考试管理系统-MyExamTest

二、 笙默考试管理系统-MyExamTest

三、 笙默考试管理系统-MyExamTest

四、 笙默考试管理系统-MyExamTest

五、 笙默考试管理系统-MyExamTest

• 笙默考试管理系统-MyExamTest

   for (;;) {

                        var end = pos + text.length;

                        var appliedStyle = style;

                        if (extraStyle) appliedStyle = style ? style + extraStyle : extraStyle;

                        span(end > upto ? text.slice(0, upto - pos) : text, appliedStyle);

                        if (end >= upto) {text = text.slice(upto - pos); pos = upto; break;}

                        pos = end;

                        text = st[i++]; style = "cm-" + st[i++];

                    }

                }

                if (sfrom != null && sto == null) span(" ", "CodeMirror-selected");

            }

• 笙默考试管理系统-MyExamTest

            if (includePre) html.push("</pre>");

            return html.join("");

        },

        cleanUp: function() {

            this.parent = null;

            if (this.marked)

                for (var i = 0, e = this.marked.length; i < e; ++i) this.marked[i].detach(this);

        }

    };

    // Utility used by replace and split above

    function copyStyles(from, to, source, dest) {

        for (var i = 0, pos = 0, state = 0; pos < to; i+=2) {

            var part = source[i], end = pos + part.length;

            if (state == 0) {

                if (end > from) dest.push(part.slice(from - pos, Math.min(part.length, to - pos)), source[i+1]);

                if (end >= from) state = 1;

            }

• 笙默考试管理系统-MyExamTest

            else if (state == 1) {

                if (end > to) dest.push(part.slice(0, to - pos), source[i+1]);

                else dest.push(part, source[i+1]);

            }

            pos = end;

        }

    }

• 笙默考试管理系统-MyExamTest

    // Data structure that holds the sequence of lines.

    function LeafChunk(lines) {

        this.lines = lines;

        this.parent = null;

        for (var i = 0, e = lines.length, height = 0; i < e; ++i) {

            lines[i].parent = this;

            height += lines[i].height;

        }

        this.height = height;

    }

    LeafChunk.prototype = {

        chunkSize: function() { return this.lines.length; },

        remove: function(at, n, callbacks) {

            for (var i = at, e = at + n; i < e; ++i) {

                var line = this.lines[i];

                this.height -= line.height;

                line.cleanUp();

• 笙默考试管理系统-MyExamTest

                if (line.handlers)

                    for (var j = 0; j < line.handlers.length; ++j) callbacks.push(line.handlers[j]);

            }

            this.lines.splice(at, n);

        },

这篇关于笙默考试管理系统-MyExamTest----codemirror（36）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---