#lang racket/base (require racket/match) (require "../tools.rkt" "../predicates.rkt" sugar txexpr/fast) (provide (all-defined-out)) ;; This module is a library of functions to be used in building pollen decoders. ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;; Typography ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;; insert typographic niceties ;; ligatures are handled in css (define (typogrify str) ;; make set of functions for replacers (define (make-replacer query replacement) (λ(str) (regexp-replace* query str replacement))) ;; just store the query strings + replacement strings (define dashes ;; fix em dashes first, else they'll be mistaken for en dashes ;; [\\s ] is whitespace + nonbreaking space '((#px"[\\s ]*(---|—)[\\s ]*" "—") ; em dash (#px"[\\s ]*(--|–)[\\s ]*" "–"))) ; en dash (define smart-quotes '((#px"(?<=\\w)'(?=\\w)" "’") ; apostrophe (#px"(?string #\u00A0)] #:minimum-word-length [minimum-word-length 6]) ;; todo: parameterize this, as it will be different for each project (define tags-to-pay-attention-to '(p aside)) ; only apply to paragraphs (define (replace-last-space str) (if (#\space . in? . str) (let ([reversed-str-list (reverse (string->list str))] [reversed-nbsp (reverse (string->list nbsp))]) (define-values (last-word-chars other-chars) (splitf-at reversed-str-list (λ(i) (not (eq? i #\space))))) (list->string (reverse (append last-word-chars ; OK for long words to be on their own line. (if (< (len last-word-chars) minimum-word-length) ; first char of other-chars will be the space, so use cdr (append reversed-nbsp (cdr other-chars)) other-chars))))) str)) (define (find-last-word-space x) ; recursively traverse xexpr (cond [(string? x) (replace-last-space x)] [(txexpr? x) (let-values([(tag attr elements) (txexpr->values x)]) (if (> (length elements) 0) ; elements is list of xexprs (let-values ([(all-but-last last) (split-at elements (sub1 (length elements)))]) (make-txexpr tag attr `(,@all-but-last ,(find-last-word-space (car last))))) x))] [else x])) (if ((car x) . in? . tags-to-pay-attention-to) (find-last-word-space x) x)) ; wrap initial quotes for hanging punctuation ; todo: improve this ; does not handle

thing properly (define (wrap-hanging-quotes nx #:single-prepend [single-pp '(squo)] #:double-prepend [double-pp '(dquo)]) (define two-or-more-char-string? (λ(i) (and (string? i) (>= (len i) 2)))) (define-values (tag attr elements) (txexpr->values nx)) (make-txexpr tag attr (if (and (list? elements) (not (empty? elements))) (let ([new-car-elements (match (car elements) [(? two-or-more-char-string? tcs) (define str-first (get tcs 0)) (define str-rest (get tcs 1 'end)) (cond [(str-first . in? . '("\"" "“")) ;; can wrap with any inline tag ;; so that linebreak detection etc still works `(,@double-pp ,(->string #\“) ,str-rest)] [(str-first . in? . '("\'" "‘")) `(,@single-pp ,(->string #\‘) ,str-rest)] [else tcs])] [(? txexpr? nx) (wrap-hanging-quotes nx)] [else (car elements)])]) (cons new-car-elements (cdr elements))) elements))) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;; Lines, blocks, paragraphs ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;; turn the right items into
tags (define (convert-linebreaks xc #:newline [newline "\n"]) ;; todo: should this test be not block + not whitespace? (define not-block? (λ(i) (not (block-xexpr? i)))) (filter-not empty? (for/list ([i (len xc)]) (let ([item (get xc i)]) (cond ;; skip first and last [(or (= i 0) (= i (sub1 (len xc)))) item] [(equal? item newline) (match (get xc (- i 1) (+ i 2)) ; a three-element slice with x[i] in the middle ;; only convert if neither adjacent tag is a block ;; (because blocks automatically force a newline before & after) [(list (? not-block?) newline (? not-block?)) '(br)] [else empty])] ; otherwise delete [else item]))))) ;; recursive whitespace test (define (whitespace? x) (cond [(or (string? x) (symbol? x)) (->boolean (regexp-match #px"^\\s+$" (->string x)))] [(equal? "" x) #t] ; empty string is deemed whitespace [(or (list? x) (vector? x)) (andmap whitespace? (->list x))] [else #f])) ;; is x a paragraph break? (define (paragraph-break? x #:pattern [paragraph-pattern #px"^\n\n+$"]) (and (string? x) (->boolean (regexp-match paragraph-pattern x)))) ;; Find adjacent newline characters in a list and merge them into one item ;; Scribble, by default, makes each newline a separate list item ;; In practice, this is worthless. (define (merge-newlines x) (define (newline? x) (and (string? x) (equal? "\n" x))) (define (not-newline? x) (not (newline? x))) (define (really-merge-newlines xs [acc '()]) (if (empty? xs) acc ;; Try to peel the newlines off the front. (let-values ([(leading-newlines remainder) (splitf-at xs newline?)]) (if (not (empty? leading-newlines)) ; if you got newlines ... ;; combine them into a string and append them to the accumulator, ;; and recurse on the rest (really-merge-newlines remainder (append acc (list (apply string-append leading-newlines)))) ;; otherwise peel off elements up to the next newline, append them to accumulator, ;; and recurse on the rest (really-merge-newlines (dropf remainder not-newline?) (append acc (takef remainder not-newline?))))))) (cond [(list? x) (really-merge-newlines (map merge-newlines x))] [else x])) ;; todo: add native support for list-xexpr ;; decode triple newlines to list items ;; prepare elements for paragraph testing (define (prep-paragraph-flow xc) (convert-linebreaks (merge-newlines (trim xc whitespace?)))) ;; apply paragraph tag (define (wrap-paragraph xc #:tag [tag 'p]) (match xc [(list (? block-xexpr? bx)) bx] ; leave a single block xexpr alone [else (make-txexpr tag empty xc)])) ; otherwise wrap in p tag ;; detect paragraphs ;; todo: unit tests (define (detect-paragraphs elements) (let ([elements (prep-paragraph-flow elements)]) (if (ormap paragraph-break? elements) ; need this condition to prevent infinite recursion (map wrap-paragraph (splitf-at* elements paragraph-break?)) ; split into ¶¶ elements)))