forked from FINAKON/HelpProject
Bhargava
6063bd1724
1. Initial Commit - a boiler plate code and POC to realize the concept of context
sensitive help
2. Frontend code written in ReactJS
3. Backend code written in Java, Spring Boot Framework
4. Frontend Start:
pre-requisites : node, npm
npm run dev ==> to start the frontend vite server
5. Backend Start:
pre-requisites : java, mvn
mvn spring-boot:run ==> to start the backend server
6. Visit http://localhost:5173/ for basic demo of help, press F1 in textboxes
7. Visit http://localhost:5173/editor and enter "admin123" to add/modify texts.
Happy Coding !!!
Thank you,
Bhargava.
115 lines
3.0 KiB
JavaScript
115 lines
3.0 KiB
JavaScript
/**
|
|
* @import {Chunk, Code, Encoding, Value} from 'micromark-util-types'
|
|
*/
|
|
|
|
/**
|
|
* @callback Preprocessor
|
|
* Preprocess a value.
|
|
* @param {Value} value
|
|
* Value.
|
|
* @param {Encoding | null | undefined} [encoding]
|
|
* Encoding when `value` is a typed array (optional).
|
|
* @param {boolean | null | undefined} [end=false]
|
|
* Whether this is the last chunk (default: `false`).
|
|
* @returns {Array<Chunk>}
|
|
* Chunks.
|
|
*/
|
|
|
|
const search = /[\0\t\n\r]/g;
|
|
|
|
/**
|
|
* @returns {Preprocessor}
|
|
* Preprocess a value.
|
|
*/
|
|
export function preprocess() {
|
|
let column = 1;
|
|
let buffer = '';
|
|
/** @type {boolean | undefined} */
|
|
let start = true;
|
|
/** @type {boolean | undefined} */
|
|
let atCarriageReturn;
|
|
return preprocessor;
|
|
|
|
/** @type {Preprocessor} */
|
|
// eslint-disable-next-line complexity
|
|
function preprocessor(value, encoding, end) {
|
|
/** @type {Array<Chunk>} */
|
|
const chunks = [];
|
|
/** @type {RegExpMatchArray | null} */
|
|
let match;
|
|
/** @type {number} */
|
|
let next;
|
|
/** @type {number} */
|
|
let startPosition;
|
|
/** @type {number} */
|
|
let endPosition;
|
|
/** @type {Code} */
|
|
let code;
|
|
value = buffer + (typeof value === 'string' ? value.toString() : new TextDecoder(encoding || undefined).decode(value));
|
|
startPosition = 0;
|
|
buffer = '';
|
|
if (start) {
|
|
// To do: `markdown-rs` actually parses BOMs (byte order mark).
|
|
if (value.charCodeAt(0) === 65279) {
|
|
startPosition++;
|
|
}
|
|
start = undefined;
|
|
}
|
|
while (startPosition < value.length) {
|
|
search.lastIndex = startPosition;
|
|
match = search.exec(value);
|
|
endPosition = match && match.index !== undefined ? match.index : value.length;
|
|
code = value.charCodeAt(endPosition);
|
|
if (!match) {
|
|
buffer = value.slice(startPosition);
|
|
break;
|
|
}
|
|
if (code === 10 && startPosition === endPosition && atCarriageReturn) {
|
|
chunks.push(-3);
|
|
atCarriageReturn = undefined;
|
|
} else {
|
|
if (atCarriageReturn) {
|
|
chunks.push(-5);
|
|
atCarriageReturn = undefined;
|
|
}
|
|
if (startPosition < endPosition) {
|
|
chunks.push(value.slice(startPosition, endPosition));
|
|
column += endPosition - startPosition;
|
|
}
|
|
switch (code) {
|
|
case 0:
|
|
{
|
|
chunks.push(65533);
|
|
column++;
|
|
break;
|
|
}
|
|
case 9:
|
|
{
|
|
next = Math.ceil(column / 4) * 4;
|
|
chunks.push(-2);
|
|
while (column++ < next) chunks.push(-1);
|
|
break;
|
|
}
|
|
case 10:
|
|
{
|
|
chunks.push(-4);
|
|
column = 1;
|
|
break;
|
|
}
|
|
default:
|
|
{
|
|
atCarriageReturn = true;
|
|
column = 1;
|
|
}
|
|
}
|
|
}
|
|
startPosition = endPosition + 1;
|
|
}
|
|
if (end) {
|
|
if (atCarriageReturn) chunks.push(-5);
|
|
if (buffer) chunks.push(buffer);
|
|
chunks.push(null);
|
|
}
|
|
return chunks;
|
|
}
|
|
} |