Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 | 93x 775x 775x 775x 775x 656x 119x 119x 119x 119x 66x 53x 2x 2x 2x 53x 57x 57x 57x 53x 53x 1439x 1439x 1439x 1439x 453x 453x 57x 26x 26x 26x 26x 26x 26x 26x 26x 26x 26x 26x 26x 26x 26x 26x 1x 1439x 1x 1x 1x 2x 1x 1x 1x 1x 1x 1439x 93x 93x | /*
Copyright (c) 2014-2015 Vitaly Puzrin, Alex Kocharin
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without
restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following
conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
*/
/*
Markdown-it 12.0.4 source
markdown-it/blob/master/lib/rules_inline/strikethrough.js adapted to fit MarkBind's needs, to:
- create new inline rules dynamically for different delimiters
*/
import MarkdownIt from 'markdown-it';
import StateInline from 'markdown-it/lib/rules_inline/state_inline';
/**
* Creates a new inline rule for markdown-it, specifically for rules that uses a 'double' delimiter.
* Some examples are ++, --, !!, %%.
* @param delimiter Represents the double delimiter to be used to create tokens when parsing.
* @param ruleName The name that represents the rule you are creating.
* @param nextRule There is a precedence ordering for the rules in markdown-it. This parameter
* lets you decide which rule to place your newly created rule before. You may refer to the following
* link for the existing inline rules in markdown-it.
* https://github.com/markdown-it/markdown-it/blob/master/lib/parser_inline.js
*/
export function createDoubleDelimiterInlineRule(delimiter: string, ruleName: string, nextRule: string) {
return function double_delimiter_plugin(md: MarkdownIt): void {
// Insert each marker as a separate text token, and add it to delimiter list
function tokenize(state: StateInline, silent: boolean): boolean {
let token;
const start = state.pos;
const marker = state.src.charCodeAt(start);
Iif (silent) { return false; }
// Check if the current character matches our specific delimiter (e.g., '!', '+', etc.)
if (marker !== delimiter.charCodeAt(0)) {
return false;
}
const scanned = state.scanDelims(state.pos, true);
let len = scanned.length;
const ch = String.fromCharCode(marker);
if (len < 2) {
return false;
}
// If we have an odd number of delimiters (like +++),
// treat the first one as plain text and use the rest as pairs.
if (len % 2) {
token = state.push('text', '', 0);
token.content = ch;
len--;
}
for (let i = 0; i < len; i += 2) {
token = state.push('text', '', 0);
token.content = ch + ch;
state.delimiters.push({
marker: marker,
length: 2, // double-delimiter rule, so length is always 2
jump: i / 2, // track position in the sequence
token: state.tokens.length - 1,
end: -1,
open: scanned.can_open,
close: scanned.can_close
});
}
state.pos += scanned.length;
return true;
}
// Walk through delimiter list and replace text tokens with tags
function postProcess(state: StateInline): boolean {
let i, j;
let startDelim;
let endDelim;
let token;
const loneMarkers: number[] = [];
const delimiters = state.delimiters;
const max = state.delimiters.length;
for (i = 0; i < max; i++) {
startDelim = delimiters[i];
if (startDelim.marker !== delimiter.charCodeAt(0)) continue;
if (startDelim.end === -1) continue;
endDelim = delimiters[startDelim.end];
// LOGIC PRESERVATION: Convert the 'text' tokens into open/close spans
token = state.tokens[startDelim.token];
token.type = `${ruleName}_open`;
token.tag = 'span';
token.attrs = [['class', ruleName]];
token.nesting = 1;
token.markup = delimiter;
token.content = '';
token = state.tokens[endDelim.token];
token.type = `${ruleName}_close`;
token.tag = 'span';
token.nesting = -1;
token.markup = delimiter;
token.content = '';
// Handle the "lone marker" edge case (odd number of markers)
if (state.tokens[endDelim.token - 1].type === 'text' &&
state.tokens[endDelim.token - 1].content === delimiter.charAt(0)) {
loneMarkers.push(endDelim.token - 1);
}
}
// If a marker sequence has an odd number of characters, it's splitted
// like this: `~~~~~` -> `~` + `~~` + `~~`, leaving one marker at the
// start of the sequence.
//
// So, we have to move all those markers after subsequent s_close tags.
while (loneMarkers.length) {
i = loneMarkers.pop()!;
j = i + 1;
while (j < state.tokens.length && state.tokens[j].type === `${ruleName}_close`) {
j++;
}
j--;
if (i !== j) {
token = state.tokens[j];
state.tokens[j] = state.tokens[i];
state.tokens[i] = token;
}
}
return true;
}
md.inline.ruler.before(nextRule, ruleName, tokenize);
md.inline.ruler2.before(nextRule, ruleName, postProcess);
};
}
|