Fantomas.Core Equivalent of q |> Queue.toSeq |> Seq.skip n |> Seq.skipWhile p |> Seq.exists f, optimized for speed append only collection optimized for quick append of block of data and query operations data - list of blocks in reverse order New position of the input cursor. This can be None when no cursor was passed as input or no position was resolved. Formatted code Transform a ParsedInput to an Oak Transform a ParsedInput to an Oak Parse a source string to SyntaxOak Parse a source string using given config Make a range from (startLine, startCol) to (endLine, endCol) to select some text Make a pos from line and column Check whether an input string is invalid in F# by attempting to parse the code. Returns the version of Fantomas found in the AssemblyInfo Format a part of source string using given config, and return the (formatted) selected part only. Beware that the range argument is inclusive. The closest expression inside the selection will be formatted if possible. Format a part of a source string and return the (formatted) selected part only. Beware that the range argument is inclusive. The closest expression inside the selection will be formatted if possible. Format SyntaxOak to string using given config Format SyntaxOak to string Format a source string using an optional config. Determines whether the F# parser will process the source as signature file. F# source code Fantomas configuration The location of a cursor, zero-based. Format a source string using an optional config. Determines whether the F# parser will process the source as signature file. F# source code Fantomas configuration Format a source string using an optional config. Determines whether the F# parser will process the source as signature file. F# source code Format an abstract syntax tree with the original source for trivia processing Format an abstract syntax tree using a given config Format an abstract syntax tree Checks if Range B is fully contained by Range A Similar to a List.fold but pass in another fold function for when the last item is reached. Removes the last element of a list `'T: not null` in `type C<'T when 'T: not null> = class end` Secondary constructor new (pat: type) = expr Each case in this DU should have a container node The content from [< to >] then <expr> Only valid in secondary constructors, original coming from SynExpr.Sequential(trivia = { SeparatorRange = Some mThen }) Represents a record instance, parsed from both `SynExpr.Record` and `SynExpr.AnonRecd`. A pattern composed from a left hand-side pattern, a single text token/operator and a right hand-side pattern. Type + arrow Type + arrow Equivalent of q |> Queue.toSeq |> Seq.skip n |> Seq.skipWhile p |> Seq.exists f Try and insert a cursor position as Trivia inside the Oak The cursor could either be inside a Node or floating around one. Initialize with a string writer and use space as delimiter current length of last line of output dummy = "fake" writer used in `autoNln`, `autoNlnByFuture` text to be written before next newline helper indentation information, if AtColumn > Indent after NewLine, Indent will be set to AtColumn current indentation lines of resulting text, in reverse order (to allow more efficient adding line to end) This helper function takes a list of expressions and ranges. If the expression is multiline it will add a newline before and after the expression. Unless it is the first expression in the list, that will never have a leading new line. F.ex. let a = AAAA let b = BBBB BBBB let c = CCCC will be formatted as: let a = AAAA let b = BBBB BBBBB let c = CCCC Similar to col, skip auto newline for index 0 similar to futureNlnCheck but validates whether the expression is going over the max page width This functions is does not use any caching try and write the expression on the remainder of the current line add an indent and newline if the expression is longer A leading expression is not consider multiline if it has a comment before it. For example let a = 7 // foo let b = 8 let c = 9 The second binding b is not consider multiline. provide the line and column before and after the leadingExpression to to the continuation expression closing token of tuple opening token of tuple opening token of anon record closing token of list opening token of list Repeat application of a function n times b is true, apply f1 otherwise apply f2 Similar to opt, but apply f2 at the beginning if there is a value similar to opt, only takes a single function f to apply when there is a value If there is a value, apply f and f' accordingly, otherwise do nothing Similar to col, apply one more function f2 at the beginning if the input sequence is not empty Similar to col, apply one more function f2 at the end if the input sequence is not empty Process collection - keeps context through the whole processing calls f for every element in sequence and f' between every two elements as a separator. This is a variant that works on typed collections. Similar to col, and supply index as well Function composition operator Write everything at current column indentation, set `indent` and `atColumn` on current column position /// Example (same as above): { X = // indent=2, atColumn=2 "some long string" // indent=6, atColumn=2 Y = 1 // indent=2, atColumn=2 } `atCurrentColumn` was called on `X`, then `indent` was called, "some long string" have indent 6, because it is indented from `atCurrentColumn` pos (2). `atCurrentColumn` was called on `X`, then `indent` was called, but "some long string" have indent only 4, because it is bigger than `atColumn` (2). Unindent one more level based on configuration Indent one more level based on configuration This adds a WriterEvent to the Context. One event could potentially be split up into multiple events. The event is also being processed in the WriterModel of the Context. When conditional defines were found in the source code, we format the code using all possible combinations. Depending on the values of each combination, code will either be produced or not. In this function, we try to piece back all the active code fragments. Check whether an input string is invalid in F# by looking for errors and warnings in the diagnostics.