bend-lint-rules

Search uses release 0.2.0.0 · 801 definitions

Releases (5)

Definitions (801)

layout/case.bend

def what
def is_local.ofWhether a name is a binder's: only its own declaration names it, so a rename touches no other file.
def is_local
def renamesThe fix that renames a local name to `to`, if recasing made one that fits.
def misfitThe finding for a name that does not fit: it says the new name when recasing makes one that fits, and, for a local name, offers the rename.
def verdict
def judged
def judge
def run
def rule

layout/directive_order.bend

type SlotA directive of a stack: its key, where its comment is, and the comment's text.
type RunA stack of directives: where it starts and ends, its last line, its last key, whether it is in order, and its directives (last first).
type RunsThe stacks so far: the open one, and the findings about the closed ones that are out of order (last first).
def keyWhat a comment's directive is sorted by: its rule, then the severity it pins, then its keyword; none if it is no directive.
def Slot.is_le
def Slot.orderThe edits that write the directives of `sorted` into the places of `slots` (both in order), onto `out`.
def Runs.close
def Run.firstA stack of one directive: its key, and its comment's place, line and text after the #.
def Runs.extend
def Runs.stepThe stacks, with a comment read: a directive on its own line, `key`, stacks on the one on the line before it.
def Runs.go
def stacks
def foundThe stacks out of order in a file that has a directive's mark.
def run
def rule

layout/format.bend

type LexTypes =====
type SymThe spellings the layout tells apart; Word{} is any other, Inc{} ends in n+.
type TokenOffsets and columns count code points.
type ScanWhat the lexer read: the end of the text, one whitespace character, or a token; with the text after it and its last character.
type RunCharacters read by run: their text and count, the text after them, and the last one.
type QuoteWhat the next character of a literal is: inside it, escaped, or past it.
type Class
type Tree
type OpenA group the tree has opened: the sym that closes it, children last first, and whether a child is a token that makes it a block.
type Built
type FlatA doc printed flat: its width up to the first break it cannot lose (a hard line, or a newline in text), and whether it has one.
type DocStr: text without its trailing whitespace, that whitespace, the width, and how many characters follow the last newline, if any.
type Measure
type ModeHow build reads a list of trees: a record, a group's children as a raw block, as comma-separated parts, or a group with no children.
type SeqA sequence being built: its docs last first, the docs of an operator chain, the previous tree, the indentation levels deepest first, and whether the rest of a run of newlines is skipped.
type PartA comma-separated part: whether it holds only newlines, and whether its last other tree ends in a comment.
type SplitA group's parts so far, last first; the current part's flags; whether the next tree ends the current part; whether a child starts with a comment.
type State
type ActWhat a child of a group does to its parts.
type Job
type PrintThe printer: jobs left, the text so far as chunks last first, the whitespace not written yet (dropped at a break or at the end), and the column.
type Fit
type RecsRecords so far, last first, and the current record, last first.
type CutA declaration record cut after its first colon, if it has one.
type Hash
type RowsThe rows so far, last first, and what the next record needs from them.
type Settingswidth: None{} for "never".
def fuel_per_pointFuel per code point of a record: more printer steps than any doc needs.
def is_blankWhitespace, as Bend's parser reads it.
def is_head
def is_word
def head_passes
def char
def drop_blank.go
def drop_blank
def trim_end
def pad
def is_same.goBase's String.eq is not tail-recursive, so long text would overflow the stack; is_same is.
def is_same
def is_not_line_endLexer -----
def is_digit_at
def is_ident_at.of
def is_ident_atA word character, or a dot before the start of a word.
def scan.go`scan`, with the text so far last character first: on the C lane, ++ copies its left side.
def scanReads characters while test holds, after text; test sees the text from each character on, so it can look ahead.
def tok
def fixed
def keyword.is
def keyword
def ident
def number.tok
def exponent.digits
def exponent.sign
def exponent.of
def exponentAfter a fraction: [eE][+-]?\d+, if it is there.
def fraction
def number.incAfter "n": n+, or n alone.
def number.of
def numberAfter a number's digits: n, n+, or a fraction and its exponent.
def tail_after
def quote_after
def literal.go`literal`, with the text so far last character first: on the C lane, ++ copies its left side.
def literal
def class_of
def single
def lex.other
def lex.char
def lex.dash
def lex.lt
def lex.shr
def lex.gt
def lex.dot
def lex.minus
def lex.eq
def lex.bang