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 | 1x 1x 1x 16x 16x 16x 16x 16x 16x 82x 82x 16x 602x 84x 84x 84x 84x 84x 84x 84x 84x 84x 80x 80x 80x 84x 2x 2x 2x 1x 1x 1x 1x 2x 2x 2x 2x 2x 2x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 2x 602x 16x 16x 9x 7x 7x 56x 56x 56x 7x 7x 7x 22x 22x 22x 7x 7x 15x 7x 7x 56x 56x 56x 28x 7x | /*--------------------------------------------------------------------------------------------- * Copyright (c) Microsoft Corporation. All rights reserved. * Licensed under the MIT License. See License.txt in the project root for license information. *--------------------------------------------------------------------------------------------*/ import { createScanner, SyntaxKind, ScanError } from 'jsonc-parser'; import { TextDocument, FoldingRangeKind, FoldingRange, FoldingRangesContext, Position } from '../jsonLanguageTypes'; export function getFoldingRanges(document: TextDocument, context?: FoldingRangesContext): FoldingRange[] { const ranges: FoldingRange[] = []; const nestingLevels: number[] = []; const stack: FoldingRange[] = []; let prevStart = -1; const scanner = createScanner(document.getText(), false); let token = scanner.scan(); function addRange(range: FoldingRange) { ranges.push(range); nestingLevels.push(stack.length); } while (token !== SyntaxKind.EOF) { switch (token) { case SyntaxKind.OpenBraceToken: case SyntaxKind.OpenBracketToken: { const startLine = document.positionAt(scanner.getTokenOffset()).line; const range = { startLine, endLine: startLine, kind: token === SyntaxKind.OpenBraceToken ? 'object' : 'array' }; stack.push(range); break; } case SyntaxKind.CloseBraceToken: case SyntaxKind.CloseBracketToken: { const kind = token === SyntaxKind.CloseBraceToken ? 'object' : 'array'; Eif (stack.length > 0 && stack[stack.length - 1].kind === kind) { const range = stack.pop(); const line = document.positionAt(scanner.getTokenOffset()).line; if (range && line > range.startLine + 1 && prevStart !== range.startLine) { range.endLine = line - 1; addRange(range); prevStart = range.startLine; } } break; } case SyntaxKind.BlockCommentTrivia: { const startLine = document.positionAt(scanner.getTokenOffset()).line; const endLine = document.positionAt(scanner.getTokenOffset() + scanner.getTokenLength()).line; if (scanner.getTokenError() === ScanError.UnexpectedEndOfComment && startLine + 1 < document.lineCount) { scanner.setPosition(document.offsetAt(Position.create(startLine + 1, 0))); } else { Eif (startLine < endLine) { addRange({ startLine, endLine, kind: FoldingRangeKind.Comment }); prevStart = startLine; } } break; } case SyntaxKind.LineCommentTrivia: { const text = document.getText().substr(scanner.getTokenOffset(), scanner.getTokenLength()); const m = text.match(/^\/\/\s*#(region\b)|(endregion\b)/); Eif (m) { const line = document.positionAt(scanner.getTokenOffset()).line; if (m[1]) { // start pattern match const range = { startLine: line, endLine: line, kind: FoldingRangeKind.Region }; stack.push(range); } else { let i = stack.length - 1; while (i >= 0 && stack[i].kind !== FoldingRangeKind.Region) { i--; } Eif (i >= 0) { const range = stack[i]; stack.length = i; Eif (line > range.startLine && prevStart !== range.startLine) { range.endLine = line; addRange(range); prevStart = range.startLine; } } } } break; } } token = scanner.scan(); } const rangeLimit = context && context.rangeLimit; if (typeof rangeLimit !== 'number' || ranges.length <= rangeLimit) { return ranges; } Iif (context && context.onRangeLimitExceeded) { context.onRangeLimitExceeded(document.uri); } const counts: number[] = []; for (let level of nestingLevels) { Eif (level < 30) { counts[level] = (counts[level] || 0) + 1; } } let entries = 0; let maxLevel = 0; for (let i = 0; i < counts.length; i++) { const n = counts[i]; Eif (n) { if (n + entries > rangeLimit) { maxLevel = i; break; } entries += n; } } const result = []; for (let i = 0; i < ranges.length; i++) { const level = nestingLevels[i]; Eif (typeof level === 'number') { if (level < maxLevel || (level === maxLevel && entries++ < rangeLimit)) { result.push(ranges[i]); } } } return result; } |